{"type":"ScholarlyArticle","title":"Rolling in Classical Planning with Conditional Effects and Constraints","authors":[{"name":"Matteo Cardellini","slug":"matteo-cardellini","given":"Matteo","family":"Cardellini","affiliation":"DIBRIS , University of Genova , Genova , Italy"},{"name":"Enrico Giunchiglia","slug":"enrico-giunchiglia","given":"Enrico","family":"Giunchiglia","affiliation":"DIBRIS , University of Genova , Genova , Italy"}],"abstract":"In classical planning, conditional effects (CEs) allow modelling non-idempotent actions, where the resulting state may depend on how many times each action is consecutively repeated. \r\n    Though CEs have been widely studied in the literature, no one has ever studied how to exploit rolling, i.e., how to effectively model the consecutive repetition of an action.\r\n    In this paper, we fill this void by (i) showing that planning with CEs remains PSPACE-complete even in the limit case of problems with a single action,   (ii) presenting a correct and complete planning as satisfiability encoding exploiting rolling while effectively dealing with constraints imposed on the set of reachable states, and (iii) theoretically and empirically showing its substantial benefits.","doi":"10.24963/ijcai.2025/942","url":"https://ijcai.org/proceedings/2025/942","pdf":"https://ijcai.org/proceedings/2025/0942.pdf","markdown":"https://ijcai.org/proceedings/2025/942.md","bibtex":"https://ijcai.org/proceedings/2025/bibtex/942","volume":{"slug":"2025","title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2025","url":"https://ijcai.org/proceedings/2025/","year":2025,"location":"Montreal, Canada","dates":"16-22 August 2025","editors":"James Kwok","isbn":"978-1-956792-06-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2025"},"section":"Planning and Scheduling","track":"Main Track","number":942,"pages":{"first":8474,"last":8482},"keywords":["Planning and Scheduling: PS: Theoretical foundations of planning","Planning and Scheduling: PS: Model-based reasoning","Planning and Scheduling: PS: Planning algorithms"],"videos":[],"references":[{"position":1,"raw":"[Balyo, 2013] Tomás Balyo. Relaxing the Relaxed Exist- Step Parallel Planning Semantics. In 25th IEEE Interna- tional Conference on Tools with Artificial Intelligence, IC- TAI 2013, Herndon, VA, USA, November 4-6, 2013, pages 865-871. IEEE Computer Society, 2013.","title":"Relaxing the Relaxed Exist-Step Parallel Planning Semantics","authors":"Tomás Balyo","year":"2013","venue":"25th IEEE International Conference on Tools with Artificial Intelligence, IC-TAI 2013","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bofill et al., 2016] Miquel Bofill, Joan Espasa, and Mateu Villaret. The RANTANPLAN planner: system descrip- tion. Knowl. Eng. Rev., 31(5):452-464, 2016.","title":"The RANTANPLAN planner: system description","authors":"Miquel Bofill, Joan Espasa, Mateu Villaret","year":"2016","venue":"Knowl. Eng. Rev","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bryant, 1985] Randal E. Bryant. Symbolic manipulation of Boolean functions using a graphical representation. In Hil- lel Ofek and Lawrence A. O'Neill, editors, Proceedings of the 22nd ACM/IEEE conference on Design automation, DAC 1985, Las Vegas, Nevada, USA, 1985, pages 688- 694. ACM, 1985.","title":"Symbolic manipulation of Boolean functions using a graphical representation","authors":"Randal E Bryant","year":"1985","venue":"Proceedings of the 22nd ACM/IEEE conference on Design automation, DAC 1985","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Burch et al., 1992] Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, and L. J. Hwang. Symbolic Model Checking: 10ˆ20 States and Beyond. Inf. Comput., 98(2):142-170, 1992.","title":"Symbolic Model Checking: 10ˆ20 States and Beyond","authors":"Jerry R Burch, Edmund M Clarke, Kenneth L Mcmillan, David L Dill, L J Hwang","year":"1992","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cardellini and Giunchiglia, 2025] Matteo Cardellini and Enrico Giunchiglia. Temporal numeric planning with pat- terns. Proceedings of the AAAI Conference on Artificial Intelligence, 39(25):26481-26489, Apr. 2025. Cardellini et al., 2024]","title":"Temporal numeric planning with patterns","authors":"Giunchiglia Cardellini, Matteo Cardellini, Enrico Giunchiglia","year":"2024","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Matteo Cardellini, Enrico Giunchiglia, and Marco Maratea. Symbolic Numeric Planning with Patterns. In Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, February 20-27, 2024, Vancouver, Canada, pages 20070-20077. AAAI Press, 2024.","title":"Symbolic Numeric Planning with Patterns","authors":"Matteo Cardellini, Enrico Giunchiglia, Marco Maratea","year":"2024","venue":"Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Clarke et al., 1996] Edmund M. Clarke, Kenneth L. McMil- lan, Sérgio Vale Aguiar Campos, and Vasiliki Hartonas- Garmhausen. Symbolic Model Checking. In Rajeev Alur and Thomas A. Henzinger, editors, Computer Aided Verification, 8th International Conference, CAV '96, New Brunswick, NJ, USA, July 31 -August 3, 1996, Proceed- ings, volume 1102 of Lecture Notes in Computer Science, pages 419-427. Springer, 1996.","title":"Symbolic Model Checking","authors":"Edmund M Clarke, Kenneth L Mcmillan, Sérgio, Vale Aguiar Campos, Vasiliki Hartonas-Garmhausen","year":"1996","venue":"Computer Aided Verification, 8th International Conference, CAV '96","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[de Moura and Bjørner, 2008] Leonardo Mendonc ¸a de Moura and Nikolaj S. Bjørner. Z3: An Efficient SMT Solver. In C. R. Ramakrishnan and Jakob Rehof, editors, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Confer- ences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, volume 4963 of Lecture Notes in Computer Science, pages 337-340. Springer, 2008.","title":"Leonardo Mendonc ¸a de Moura and Nikolaj S. Bjørner. Z3: An Efficient SMT Solver","authors":"De Moura, Bjørner","year":"2008","venue":"Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gazen and Knoblock, 1997] B. Cenk Gazen and Craig A. Knoblock. Combining the Expressivity of UCPOP with the Efficiency of Graphplan. In Sam Steel and Rachid Alami, editors, Recent Advances in AI Planning, 4th Euro- pean Conference on Planning, ECP'97, Toulouse, France, September 24-26, 1997, Proceedings, volume 1348 of Lec- ture Notes in Computer Science, pages 221-233. Springer, 1997.","title":"Combining the Expressivity of UCPOP with the Efficiency of Graphplan","authors":"B, Cenk Gazen, Craig A Knoblock","year":"1997","venue":"Recent Advances in AI Planning, 4th European Conference on Planning, ECP'97","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gerevini et al., 2024] Alfonso Emilio Gerevini, Francesco Percassi, and Enrico Scala. An Effective Polynomial Tech- nique for Compiling Conditional Effects Away. In Thirty- Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, February 20-27, 2024, Vancouver, Canada, pages 20104-20112. AAAI Press, 2024.","title":"Alfonso Emilio Gerevini, Francesco Percassi, and Enrico Scala. An Effective Polynomial Technique for Compiling Conditional Effects Away","authors":"Gerevini","year":"2024","venue":"Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Katz, 2019] Michael Katz. Red-Black Heuristics for Plan- ning Tasks with Conditional Effects. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 -February 1, 2019, pages 7619-7626. AAAI Press, 2019.","title":"Red-Black Heuristics for Planning Tasks with Conditional Effects","authors":"Michael Katz","year":"2019","venue":"The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kautz and Selman, 1992] Henry A. Kautz and Bart Selman. Planning as Satisfiability. In Bernd Neumann, editor, 10th European Conference on Artificial Intelligence, ECAI 92, Vienna, Austria, August 3-7, 1992. Proceedings, pages 359-363.","title":"Planning as Satisfiability","authors":"Henry A Kautz, Bart Selman","year":"1992","venue":"10th European Conference on Artificial Intelligence, ECAI 92","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Matsunaga et al., 1993] Yusuke Matsunaga, Patrick C. McGeer, and Robert K. Brayton. On Computing the Tran- sitive Closure of a State Transition Relation. In Alfred E. Dunlop, editor, Proceedings of the 30th Design Automa- tion Conference. Dallas, Texas, USA, June 14-18, 1993, pages 260-265. ACM Press, 1993.","title":"On Computing the Transitive Closure of a State Transition Relation","authors":"Yusuke Matsunaga, Patrick C Mcgeer, Robert K Brayton","year":"1993","venue":"Proceedings of the 30th Design Automation Conference","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Nebel, 2000] Bernhard Nebel. On the Compilability and Expressive Power of Propositional Planning Formalisms. J. Artif. Intell. Res., 12:271-315, 2000.","title":"On the Compilability and Expressive Power of Propositional Planning Formalisms","authors":"Bernhard Nebel","year":"2000","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Rintanen, 2011] Jussi Rintanen. Heuristics for Planning with SAT and Expressive Action Definitions. In Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, and Malte Helmert, editors, Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI, 2011.","title":"Heuristics for Planning with SAT and Expressive Action Definitions","authors":"Jussi Rintanen","year":"2011","venue":"Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Röger et al., 2014] Gabriele Röger, Florian Pommerening, and Malte Helmert. Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, editors, ECAI 2014 -21st European Confer- ence on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic -Including Prestigious Applications of In- telligent Systems (PAIS 2014), volume 263 of Frontiers in Artificial Intelligence and Applications, pages 765-770. IOS Press, 2014.","title":"Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting","authors":"Gabriele Röger, Florian Pommerening, Malte Helmert","year":"2014","venue":"Czech Republic -Including Prestigious Applications of Intelligent Systems (PAIS 2014)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Scala et al., 2016] Enrico Scala, Miquel Ramírez, Patrik Haslum, and Sylvie Thiébaux. Numeric Planning with Disjunctive Global Constraints via SMT. In Amanda Jane Coles, Andrew Coles, Stefan Edelkamp, Daniele Mag- azzeni, and Scott Sanner, editors, Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016, pages 276-284. AAAI Press, 2016.","title":"Numeric Planning with Disjunctive Global Constraints via SMT","authors":"Enrico Scala, Miquel Ramírez, Patrik Haslum, Sylvie Thiébaux","year":"2016","venue":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Sipser, 1997] Michael Sipser. Introduction to the theory of computation. PWS Publishing Company, 1997.","title":"Introduction to the theory of computation","authors":"Michael Sipser","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Wehrle and Rintanen, 2007] Martin Wehrle and Jussi Rinta- nen. Planning as Satisfiability with Relaxed ∃-Step Plans. In Mehmet A. Orgun and John Thornton, editors, AI 2007: Advances in Artificial Intelligence, 20th Australian Joint Conference on Artificial Intelligence, Gold Coast, Aus- tralia, December 2-6, 2007, Proceedings, volume 4830 of Lecture Notes in Computer Science, pages 244-253.","title":"Planning as Satisfiability with Relaxed ∃-Step Plans","authors":"Martin Wehrle, Jussi Rintanen","year":"2007","venue":"AI 2007: Advances in Artificial Intelligence, 20th Australian Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}