{"type":"ScholarlyArticle","title":"Lifted Planning: Recent Advances in Planning Using First-Order Representations","authors":[{"name":"Augusto B. Corrêa","slug":"augusto-b-correa","given":"Augusto B.","family":"Corrêa","affiliation":"University of Basel , Switzerland"},{"name":"Giuseppe De Giacomo","slug":"giuseppe-de-giacomo","given":"Giuseppe","family":"De Giacomo","affiliation":"University of Oxford , England , UK"}],"abstract":"Lifted planning is usually defined as planning directly over a first-order representation. From the mid-1990s until the late 2010s, lifted planning was sidelined, as most of the state-of-the-art planners first ground the task and then solve it using a propositional representation. Moreover, it was unclear whether lifted planners could scale. But as planning problems become harder, they also become infeasible to ground. Recently, lifted planners came back into play, aiming at problems where grounding is a bottleneck. In this work, we survey recent advances in lifted planning. The main techniques rely either on state-space search or logic satisfiability. For lifted search-based planners, we show the direct connections to other areas of computer science, such as constraint satisfaction problems and databases. For lifted planners based on satisfiability, the advances in modeling are crucial to their scalability. We briefly describe the main planners available in the literature and their techniques.","doi":"10.24963/ijcai.2024/886","url":"https://ijcai.org/proceedings/2024/886","pdf":"https://ijcai.org/proceedings/2024/0886.pdf","markdown":"https://ijcai.org/proceedings/2024/886.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/886","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Survey Track","track":"Survey Track","number":886,"pages":{"first":8010,"last":8019},"keywords":["Knowledge Representation and Reasoning: KRR: Reasoning about actions","Planning and Scheduling: General"],"videos":[],"references":[{"position":1,"raw":"[Abiteboul et al., 1995] Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.","title":"Foundations of Databases","authors":"Serge Abiteboul, Richard Hull, Victor Vianu","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bäckström and Nebel, 1995] Christer Bäckström and Bern- hard Nebel. Complexity results for SAS + planning. Com- putational Intelligence, 11(4):625-655, 1995.","title":"Christer Bäckström and Bernhard Nebel","authors":"Nebel Bäckström","year":"1995","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bibel, 1986] Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4(2):115-32, 1986.","title":"Wolfgang Bibel. A deductive solution for plan generation","authors":"Bibel","year":"1986","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Planning as heuristic search. AIJ, 129(1):5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2001","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calvanese et al., 2018] Diego Calvanese, Giuseppe De Gi- acomo, Marco Montali, and Fabio Patrizi. First-order µ- calculus over generic transition systems and applications to the situation calculus. Inf. Comput., 259(3):328-347, 2018.","title":"First-order µcalculus over generic transition systems and applications to the situation calculus","authors":"Calvanese","year":"2018","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chandra and Merlin, 1977] Ashok K. Chandra and Philip M. Merlin. Optimal implementation of con- junctive queries in relational databases. In Proc. STOC 1977, pages 77-90, 1977.","title":"Optimal implementation of conjunctive queries in relational databases","authors":"K Ashok, Philip M Chandra, Merlin","year":"1977","venue":"Proc. STOC 1977","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Corrêa and Seipp, 2022] Augusto B. Corrêa and Jendrik Seipp. Best-first width search for lifted classical planning. In Proc. ICAPS 2022, pages 11-15, 2022.","title":"Best-first width search for lifted classical planning","authors":"Augusto B Corrêa, Jendrik Seipp","year":"2022","venue":"Proc. ICAPS 2022","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Corrêa et al., 2020] Augusto B. Corrêa, Florian Pommeren- ing, Malte Helmert, and Guillem Francès. Lifted successor generation using query optimization techniques. In Proc. ICAPS 2020, pages 80-89, 2020.","title":"Lifted successor generation using query optimization techniques","authors":"Augusto B Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès","year":"2020","venue":"Proc. ICAPS 2020","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Corrêa et al., 2021] Augusto B. Corrêa, Guillem Francès, Florian Pommerening, and Malte Helmert. Delete- relaxation heuristics for lifted classical planning. In Proc. ICAPS 2021, pages 94-102, 2021.","title":"Deleterelaxation heuristics for lifted classical planning","authors":"Augusto B Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert","year":"2021","venue":"Proc. ICAPS 2021","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Corrêa et al., 2022] Augusto B. Corrêa, Florian Pommeren- ing, Malte Helmert, and Guillem Francès. The FF heuris- tic for lifted classical planning. In Proc. AAAI 2022, pages 9716-9723, 2022.","title":"The FF heuristic for lifted classical planning","authors":"Augusto B Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès","year":"2022","venue":"Proc. AAAI 2022","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Corrêa et al., 2024] Augusto B. Corrêa, Giuseppe De Gia- como, Malte Helmert, and Sasha Rubin. Planning with object creation. In Proc. ICAPS 2024, 2024. To appear.","title":"Planning with object creation","authors":"Augusto B Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin","year":"2024","venue":"Proc. ICAPS 2024","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[De Giacomo et al., 2016] Giuseppe De Giacomo, Yves Lespérance, and Fabio Patrizi. Bounded situation calcu- lus action theories. AIJ, 237:172-203, 2016.","title":"Bounded situation calculus action theories","authors":"Giuseppe De, Giacomo, Yves Lespérance, Fabio Patrizi","year":"2016","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Edelkamp et al., 2019] Stefan Edelkamp, Alberto Lluch- Lafuente, and Ionut Moraru. Introducing dynamic object creation to PDDL planning. https://openreview.net/forum? id=rkxRj58y5N, 2019.","title":"Introducing dynamic object creation to PDDL planning","authors":"Stefan Edelkamp, Alberto Lluch-Lafuente, Ionut Moraru","year":"2019","venue":null,"doi":null,"url":"https://openreview.net/forum?id=rkxRj58y5","internal_url":null},{"position":14,"raw":"[Ernst et al., 1997] Michael D. Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic sat-compilation of planning problems. In Proc. IJCAI 1997, pages 1169-1177, 1997.","title":"Automatic sat-compilation of planning problems","authors":"D Michael, Todd D Ernst, Daniel S Millstein, Weld","year":"1997","venue":"Proc. IJCAI 1997","doi":null,"url":null,"internal_url":"/proceedings/1997/169"},{"position":15,"raw":"[Fikes and Nilsson, 1971] Richard E. Fikes and Nils J. Nils- son. STRIPS: A new approach to the application of theo- rem proving to problem solving. AIJ, 2:189-208, 1971.","title":"STRIPS: A new approach to the application of theorem proving to problem solving","authors":"Richard E Fikes, Nils J Nilsson","year":"1971","venue":"AIJ","doi":null,"url":null,"internal_url":"/proceedings/1971/63"},{"position":16,"raw":"[Fišer, 2020] Daniel Fišer. Lifted fact-alternating mutex groups and pruned grounding of classical planning prob- lems. In Proc. AAAI 2020, pages 9835-9842, 2020.","title":"Lifted fact-alternating mutex groups and pruned grounding of classical planning problems","authors":"Daniel Fišer","year":"2020","venue":"Proc. AAAI 2020","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Francès and Geffner, 2016] Guillem Francès and Héctor Geffner. ∃-STRIPS: Existential quantification in planning and constraint satisfaction. In Proc. IJCAI 2016, pages 3082-3088, 2016.","title":"∃-STRIPS: Existential quantification in planning and constraint satisfaction","authors":"Geffner Francès, Guillem Francès, Héctor Geffner","year":"2016","venue":"Proc. IJCAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/437"},{"position":18,"raw":"[Francès et al., 2017] Guillem Francès, Miquel Ramírez, Nir Lipovetzky, and Héctor Geffner. Purely declarative action representations are overrated: Classical planning with sim- ulators. In Proc. IJCAI 2017, pages 4294-4301, 2017.","title":"Purely declarative action representations are overrated: Classical planning with simulators","authors":"Guillem Francès, Miquel Ramírez, Nir Lipovetzky, Héctor Geffner","year":"2017","venue":"Proc. IJCAI 2017","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Francès et al., 2018] Guillem Francès, Hector Geffner, Nir Lipovetzky, and Miquel Ramiréz. Best-first width search in the IPC 2018: Complete, simulated, and polynomial variants. In IPC-9 Planner Abstracts, pages 23-27, 2018.","title":"Best-first width search in the IPC 2018: Complete, simulated, and polynomial variants","authors":"Guillem Francès, Hector Geffner, Nir Lipovetzky, Miquel Ramiréz","year":"2018","venue":"IPC-9 Planner Abstracts","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Francès, 2017] Guillem Francès. Effective Planning with Expressive Languages. PhD thesis, Universitat Pompeu Fabra, 2017.","title":"Effective Planning with Expressive Languages","authors":"Guillem Francès","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Fuentetaja and de la Rosa, 2016] Raquel Fuentetaja and Tomás de la Rosa. Compiling irrelevant objects to counters. special case of creation planning. AI Communi- cations, 29(3):435-467, 2016.","title":"Raquel Fuentetaja and Tomás de la Rosa. Compiling irrelevant objects to counters. special case of creation planning","authors":"Rosa Fuentetaja","year":"2016","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Geffner, 2000] Héctor Geffner. Functional Strips: A more flexible language for planning and problem solving. In Jack Minker, editor, Logic-Based Artificial Intelligence, volume 597 of Kluwer International Series In Engineering And Computer Science, chapter 9, pages 187-209. Kluwer, Dordrecht, 2000.","title":"Functional Strips: A more flexible language for planning and problem solving","authors":"Héctor Geffner","year":"2000","venue":"Logic-Based Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Gottlob et al., 2002] Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sci- ences, 64(3):579-627, 2002.","title":"Hypertree decompositions and tractable queries","authors":"Gottlob","year":"2002","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Green, 1969a] Cordell Green. Application of theorem prov- ing to problem solving. In Proc. IJCAI 1969, pages 219- 239, 1969.","title":"Application of theorem proving to problem solving","authors":"Cordell Green, Green","year":"1969","venue":"Proc. IJCAI 1969","doi":null,"url":null,"internal_url":"/proceedings/1969/22"},{"position":25,"raw":"[Green, 1969b] Cordell Green. Theorem-proving by resolu- tion as a basis for question-answering systems. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 4, pages 183-205. Edinburgh University Press, 1969.","title":"Theorem-proving by resolution as a basis for question-answering systems","authors":"Cordell Green, Green","year":"1969","venue":"Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Haslum et al., 2019] Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, and Christian Muise. An Introduction to the Planning Domain Definition Language, volume 13 of Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool, 2019.","title":"An Introduction to the Planning Domain Definition Language","authors":"Haslum","year":"2019","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Helmert and Domshlak, 2009] Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Proc. ICAPS 2009, pages 162-169, 2009.","title":"Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway?","authors":"Domshlak Helmert","year":"2009","venue":"Proc. ICAPS 2009","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Helmert, 2002] Malte Helmert. Decidability and undecid- ability results for planning with numerical state variables. In Proc. AIPS 2002, pages 303-312, 2002.","title":"Decidability and undecidability results for planning with numerical state variables","authors":"Malte Helmert, Helmert","year":"2002","venue":"Proc. AIPS 2002","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward plan- ning system. JAIR, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Helmert, 2009] Malte Helmert. Concise finite-domain rep- resentations for PDDL planning tasks. AIJ, 173:503-535, 2009.","title":"Concise finite-domain representations for PDDL planning tasks","authors":"Malte Helmert, Helmert","year":"2009","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Hoffmann and Nebel, 2001] Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.","title":"The FF planning system: Fast plan generation through heuristic search","authors":"Nebel Hoffmann, Jörg Hoffmann, Bernhard Nebel","year":"2001","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Hoffmann et al., 2004] Jörg Hoffmann, Julie Porteous, and Laura Sebastia. Ordered landmarks in planning. JAIR, 22:215-278, 2004.","title":"Ordered landmarks in planning","authors":"Hoffmann","year":"2004","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Hoffmann et al., 2009] Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, and Marco Pistore. Message-based web service composition, integrity constraints, and planning under uncertainty: A new connection. JAIR, 35:49-117, 2009.","title":"Message-based web service composition, integrity constraints, and planning under uncertainty: A new connection","authors":"Hoffmann","year":"2009","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Höller and Behnke, 2022] Daniel Höller and Gregor Behnke. Encoding lifted classical planning in propo- sitional logic. In Proc. ICAPS 2022, pages 134-144, 2022.","title":"Encoding lifted classical planning in propositional logic","authors":"Behnke ; ] Daniel Höller, Gregor Höller, Behnke","year":"2022","venue":"Proc. ICAPS 2022","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Horčík and Fišer, 2021] Rostislav Horčík and Daniel Fišer. Endomorphisms of lifted planning problems. In Proc. ICAPS 2021, pages 174-183, 2021.","title":"Rostislav Horčík and Daniel Fišer. Endomorphisms of lifted planning problems","authors":"Fišer Horčík","year":"2021","venue":"Proc. ICAPS 2021","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Horčík and Fišer, 2023] Rostislav Horčík and Daniel Fišer. Gaifman graphs in lifted planning. In Proc. ECAI 2023, pages 1052-1059, 2023.","title":"Rostislav Horčík and Daniel Fišer. Gaifman graphs in lifted planning","authors":"Fišer Horčík","year":"2023","venue":"Proc. ECAI 2023","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Horčík et al., 2022] Rostislav Horčík, Daniel Fišer, and Álvaro Torralba. Homomorphisms of lifted planning tasks: The case for delete-free relaxation heuristics. In Proc. AAAI 2022, pages 9767-9775, 2022.","title":"Homomorphisms of lifted planning tasks: The case for delete-free relaxation heuristics","authors":"Horčík","year":"2022","venue":"Proc. AAAI 2022","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Kautz and Selman, 1992] Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI 1992, pages 359- 363, 1992.","title":"Planning as satisfiability","authors":"Henry Kautz, Bart Selman","year":"1992","venue":"Proc. ECAI 1992","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Kolaitis and Vardi, 2000] Phokion G. Kolaitis and Moshe Y. Vardi. Conjunctive-query containment and constraint sat- isfaction. Journal of Computer and System Sciences, 61(2):302-332, 2000.","title":"Conjunctive-query containment and constraint satisfaction","authors":"Kolaitis, G Vardi ; Phokion, Moshe Y Kolaitis, Vardi","year":"2000","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Kowalski, 1979] Robert A. Kowalski. Logic for Problem Solving, volume 7 of The Computer Science Library: Ar- tificial Intelligence Series. North-Holland, 1979.","title":"Logic for Problem Solving","authors":"Robert A Kowalski","year":"1979","venue":"of The Computer Science Library: Artificial Intelligence Series","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Lauer et al., 2021] Pascal Lauer, Álvaro Torralba, Daniel Fiser, Daniel Höller, Julia Wichlacz, and Jörg Hoffmann. Polynomial-time in PDDL input size: Making the delete relaxation feasible for lifted planning. In Proc. IJCAI 2021, pages 4119-4126, 2021.","title":"Polynomial-time in PDDL input size: Making the delete relaxation feasible for lifted planning","authors":"Pascal Lauer, Álvaro Torralba, Daniel Fiser, Daniel Höller, Julia Wichlacz, Jörg Hoffmann","year":"2021","venue":"Proc. IJCAI 2021","doi":null,"url":null,"internal_url":"/proceedings/2021/567"},{"position":42,"raw":"[Levesque, 1996] Hector J. Levesque. What is planning in the presence of sensing? pages 1139-1146, 1996.","title":"What is planning in the presence of sensing?","authors":"Hector J Levesque","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Levesque, 2005] Hector J. Levesque. Planning with loops. In Proc. IJCAI 2005, pages 509-515, 2005.","title":"Planning with loops","authors":"Hector J Levesque","year":"2005","venue":"Proc. IJCAI 2005","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Lifschitz, 1987] Vladimir Lifschitz. On the semantics of STRIPS. In M. Georgeff and A. Lansky, editors, Reason- ing about Actions and Plans, pages 1-9.","title":"On the semantics of STRIPS","authors":"Vladimir Lifschitz","year":null,"venue":"Reasoning about Actions and Plans","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"Morgan Kauf- mann, 1987.","title":null,"authors":"Morgan Kaufmann","year":"1987","venue":null,"doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Lipovetzky and Geffner, 2012] Nir Lipovetzky and Hector Geffner. Width and serialization of classical planning problems. In Proc. ECAI 2012, pages 540-545, 2012.","title":"Width and serialization of classical planning problems","authors":"Geffner Lipovetzky, Nir Lipovetzky, Hector Geffner","year":"2012","venue":"Proc. ECAI 2012","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Lipovetzky and Geffner, 2017] Nir Lipovetzky and Hector Geffner. Best-first width search: Exploration and exploita- tion in classical planning. In Proc. AAAI 2017, pages 3590-3596, 2017.","title":"Best-first width search: Exploration and exploitation in classical planning","authors":"Geffner Lipovetzky, Nir Lipovetzky, Hector Geffner","year":"2017","venue":"Proc. AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Matloob and Soutchanski, 2016] Rami Matloob and Mikhail Soutchanski. Exploring organic synthesis with state-of-the-art planning techniques. In ICAPS 2016 Scheduling and Planning Applications woRKshop, pages 52-61, 2016.","title":"Exploring organic synthesis with state-of-the-art planning techniques","authors":"Rami Matloob, Mikhail Soutchanski","year":"2016","venue":"ICAPS 2016 Scheduling and Planning Applications woRKshop","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[McAllester and Rosenblitt, 1991] David A. McAllester and David Rosenblitt. Systematic nonlinear planning. In Proc. AAAI 1991, pages 634-639, 1991.","title":"Systematic nonlinear planning","authors":"David A Mcallester, David Rosenblitt","year":"1991","venue":"Proc. AAAI 1991","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[McCarthy and Hayes, 1969] John McCarthy and Patrick J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 4, pages 463-502. Edinburgh University Press, 1969.","title":"Some philosophical problems from the standpoint of artificial intelligence","authors":"John Mccarthy, Patrick J Hayes","year":"1969","venue":"Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[McCarthy, 1958] John McCarthy. Programs with common sense. In Proceedings of the Teddington Conference on the Mechanization of Thought Processes, pages 75-91. Her Majesty's Stationary Office, London, 1958.","title":"Programs with common sense","authors":"John Mccarthy","year":"1958","venue":"Proceedings of the Teddington Conference on the Mechanization of Thought Processes","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[McCarthy, 1963] John McCarthy. Situations, actions, and causal laws. Memo 2, Stanford University Artificial Intel- ligence Project, Stanford, California, 1963.","title":"Situations, actions, and causal laws","authors":"John Mccarthy","year":"1963","venue":null,"doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[McDermott et al., 1998] Drew McDermott, Malik Ghallab, Adele Howe, Craig Knoblock, Ashwin Ram, Manuela Veloso, Daniel Weld, and David Wilkins. PDDL - The Planning Domain Definition Language -Version 1.2. Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, Yale Uni- versity, 1998.","title":"PDDL -The Planning Domain Definition Language -Version 1.2","authors":"Drew Mcdermott, Malik Ghallab, Adele Howe, Craig Knoblock, Ashwin Ram, Manuela Veloso, Daniel Weld, David Wilkins","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[McDermott, 1996] Drew McDermott. A heuristic estimator for means-ends analysis in planning. In Proc. AIPS 1996, pages 142-149, 1996.","title":"A heuristic estimator for means-ends analysis in planning","authors":"Drew Mcdermott","year":"1996","venue":"Proc. AIPS 1996","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[McDermott, 2000] Drew McDermott. The 1998 AI Plan- ning Systems competition. AI Magazine, 21(2):35-55, 2000.","title":"The 1998 AI Planning Systems competition","authors":"Drew Mcdermott","year":"2000","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Muise et al., 2012] Christian J. Muise, Sheila A. McIlraith, and J. Christopher Beck. Improved non-deterministic planning by exploiting state relevance. In Proc. ICAPS 2012, pages 172-180, 2012.","title":"Improved non-deterministic planning by exploiting state relevance","authors":"Christian J Muise, Sheila A Mcilraith, J Christopher Beck","year":"2012","venue":"Proc. ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Newell and Simon, 1963] Allen Newell and Herbert A. Si- mon. GPS: A program that simulates human thought. In E. A. Feigenbaum and J. Feldman, editors, Computers and Thought, pages 279-293. Oldenbourg, 1963.","title":"GPS: A program that simulates human thought","authors":"Allen Newell, Herbert A Simon","year":"1963","venue":"Computers and Thought","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Pednault, 1989] Edwin P. D. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proc. KR 1989, pages 324-332, 1989.","title":"ADL: Exploring the middle ground between STRIPS and the situation calculus","authors":"P D Edwin, Pednault","year":"1989","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Penberthy and Weld, 1992] J. Scott Penberthy and Daniel S. Weld. UCPOP: A sound, complete, partial order planner for ADL. In Proc. KR 1992, pages 103-114, 1992.","title":"UCPOP: A sound, complete, partial order planner for ADL","authors":"J, Scott Penberthy, Daniel S Weld","year":"1992","venue":"Proc. KR 1992","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Pommerening et al., 2014] Florian Pommerening, Gabriele Röger, Malte Helmert, and Blai Bonet. LP-based heuris- tics for cost-optimal planning. In Proc. ICAPS 2014, pages 226-234, 2014.","title":"LP-based heuristics for cost-optimal planning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet","year":"2014","venue":"Proc. ICAPS 2014","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Porteous et al., 2001] Julie Porteous, Laura Sebastia, and Jörg Hoffmann. On the extraction, ordering, and usage of landmarks in planning. In Proc. ECP 2001, pages 174- 182, 2001.","title":"On the extraction, ordering, and usage of landmarks in planning","authors":"Julie Porteous, Laura Sebastia, Jörg Hoffmann","year":"2001","venue":"Proc. ECP 2001","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Reiter, 2001] Raymond Reiter. Knowledge in Action: Logi- cal Foundations for Specifying and Implementing Dynam- ical Systems. MIT Press, 2001.","title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","authors":"Raymond Reiter","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Richter and Helmert, 2009] Silvia Richter and Malte Helmert. Preferred operators and deferred evaluation in satisficing planning. In Proc. ICAPS 2009, pages 273-280, 2009.","title":"Preferred operators and deferred evaluation in satisficing planning","authors":"Helmert Richter, Silvia Richter, Malte Helmert","year":"2009","venue":"Proc. ICAPS 2009","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Richter and Westphal, 2008] Silvia Richter and Matthias Westphal. The LAMA planner -Using landmark count- ing in heuristic search. IPC 2008 short papers, http: //ipc.informatik.uni-freiburg.de/Planners, 2008.","title":"The LAMA planner -Using landmark counting in heuristic search","authors":"Silvia Richter, Matthias Westphal","year":"2008","venue":"IPC 2008 short papers","doi":null,"url":"http://ipc.informatik.uni-freiburg.de/Planners","internal_url":null},{"position":65,"raw":"[Richter et al., 2008] Silvia Richter, Malte Helmert, and Matthias Westphal. Landmarks revisited. In Proc. AAAI 2008, pages 975-982, 2008.","title":"Landmarks revisited","authors":"Silvia Richter, Malte Helmert, Matthias Westphal","year":"2008","venue":"Proc. AAAI 2008","doi":null,"url":null,"internal_url":null},{"position":66,"raw":"[Ridder and Fox, 2014] Bram Ridder and Maria Fox. Heuristic evaluation based on lifted relaxed planning graphs. In Proc. ICAPS 2014, pages 244-252, 2014.","title":"Heuristic evaluation based on lifted relaxed planning graphs","authors":"Fox ; Ridder, Bram Ridder, Maria Fox","year":"2014","venue":"Proc. ICAPS 2014","doi":null,"url":null,"internal_url":null},{"position":67,"raw":"[Robinson et al., 2009] Nathan Robinson, Charles Gretton, Duc Nghia Pham, and Abdul Sattar. SAT-based parallel planning using a split representation of actions. In Proc. ICAPS 2009, pages 281-288, 2009.","title":"SAT-based parallel planning using a split representation of actions","authors":"Nathan Robinson, Charles Gretton, Duc Nghia Pham, Abdul Sattar","year":"2009","venue":"Proc. ICAPS 2009","doi":null,"url":null,"internal_url":null},{"position":68,"raw":"[Röger and Helmert, 2010] Gabriele Röger and Malte Helmert. The more, the merrier: Combining heuristic estimators for satisficing planning. In Proc. ICAPS 2010, pages 246-249, 2010.","title":"The more, the merrier: Combining heuristic estimators for satisficing planning","authors":"Helmert Röger, Gabriele Röger, Malte Helmert","year":"2010","venue":"Proc. ICAPS 2010","doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Sandewall, 1995] Erik Sandewall. Features and Fluents. Clarendon Press, 1995.","title":"Features and Fluents","authors":"Erik Sandewall","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Saribatur et al., 2021] Zeynep G. Saribatur, Thomas Eiter, and Peter Schüller. Abstraction for non-ground answer set programs. AIJ, 300:103563, 2021.","title":"Abstraction for non-ground answer set programs","authors":"G Zeynep, Thomas Saribatur, Peter Eiter, Schüller","year":"2021","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Seipp, 2023] Jendrik Seipp. Scorpion 2023. In IPC-10 Planner Abstracts, 2023.","title":"Scorpion","authors":"Jendrik Seipp","year":"2023","venue":"IPC-10 Planner Abstracts","doi":null,"url":null,"internal_url":null},{"position":72,"raw":"[Shaik and van de Pol, 2022] Irfansha Shaik and Jaco van de Pol. Classical planning as QBF without grounding. In Proc. ICAPS 2022, pages 329-337, 2022.","title":"Irfansha Shaik and Jaco van de Pol. Classical planning as QBF without grounding","authors":"Van Shaik, De Pol","year":"2022","venue":"Proc. ICAPS 2022","doi":null,"url":null,"internal_url":null},{"position":73,"raw":"[Shanahan, 1997] Murray Shanahan. Solving the Frame Problem. MIT Press, 1997.","title":"Solving the Frame Problem","authors":"Murray Shanahan","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":74,"raw":"[Sievers and Helmert, 2021] Silvan Sievers and Malte Helmert. Merge-and-shrink: A compositional theory of transformations of factored transition systems. JAIR, 71:781-883, 2021.","title":"Merge-and-shrink: A compositional theory of transformations of factored transition systems","authors":"Helmert Sievers, Silvan Sievers, Malte Helmert","year":"2021","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":75,"raw":"[Ståhlberg, 2023] Simon Ståhlberg. Lifted successor gener- ation by maximum clique enumeration. In Proc. ECAI 2023, pages 2194-2201, 2023.","title":"Lifted successor generation by maximum clique enumeration","authors":"Simon Ståhlberg","year":"2023","venue":"Proc. ECAI 2023","doi":null,"url":null,"internal_url":null},{"position":76,"raw":"[Thielscher, 2005] Michael Thielscher. Reasoning Robots. Springer, 2005.","title":"Reasoning Robots","authors":"Michael Thielscher","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":77,"raw":"[Torralba et al., 2014] Álvaro Torralba, Vidal Alcázar, Daniel Borrajo, Peter Kissmann, and Stefan Edelkamp. SymBA*: A symbolic bidirectional A* planner. In IPC-8 Planner Abstracts, pages 105-109, 2014.","title":"SymBA*: A symbolic bidirectional A* planner","authors":"Álvaro Torralba, Daniel Vidal Alcázar, Peter Borrajo, Stefan Kissmann, Edelkamp","year":"2014","venue":"IPC-8 Planner Abstracts","doi":null,"url":null,"internal_url":null},{"position":78,"raw":"[Weld, 1994] Daniel S. Weld. An introduction to least com- mitment planning. AI Magazine, 15(4):27-61, 1994.","title":"An introduction to least commitment planning","authors":"S Daniel, Weld","year":"1994","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":79,"raw":"[Wichlacz et al., 2022] Julia Wichlacz, Daniel Höller, and Jörg Hoffmann. Landmark heuristics for lifted classical planning. In Proc. IJCAI 2022, pages 4665-4671, 2022.","title":"Landmark heuristics for lifted classical planning","authors":"Julia Wichlacz, Daniel Höller, Jörg Hoffmann","year":"2022","venue":"Proc. IJCAI 2022","doi":null,"url":null,"internal_url":"/proceedings/2022/647"},{"position":80,"raw":"[Wichlacz et al., 2023] Julia Wichlacz, Daniel Höller, Daniel Fišer, and Jörg Hoffmann. A landmark-cut heuris- tic for lifted optimal planning. In Proc. ECAI 2023, pages 2623-2630, 2023.","title":"A landmark-cut heuristic for lifted optimal planning","authors":"Julia Wichlacz, Daniel Höller, Daniel Fišer, Jörg Hoffmann","year":"2023","venue":"Proc. ECAI 2023","doi":null,"url":null,"internal_url":null},{"position":81,"raw":"[Yannakakis, 1981] Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proc. VLDB 1981, pages 82- 94, 1981.","title":"Algorithms for acyclic database schemes","authors":"Mihalis Yannakakis","year":"1981","venue":"Proc. VLDB 1981","doi":null,"url":null,"internal_url":null},{"position":82,"raw":"[Younes and Simmons, 2002] Håkan L. S. Younes and Reid G. Simmons. On the role of ground actions in refine- ment planning. In Proc. AIPS 2002, pages 54-62, 2002.","title":"On the role of ground actions in refinement planning","authors":"L S Håkan, Reid G Younes, Simmons","year":"2002","venue":"Proc. AIPS 2002","doi":null,"url":null,"internal_url":null},{"position":83,"raw":"[Younes and Simmons, 2003] Håkan L. S. Younes and Reid G. Simmons. VHPOP: Versatile heuristic partial or- der planner. JAIR, 20:405-430, 2003.","title":"VHPOP: Versatile heuristic partial order planner","authors":"L S Håkan, Reid G Younes, Simmons","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}