Efficient SMT formulations for classical planning

DOI10.1016/J.JLAMP.2026.101145MaRDI QIDQ7320665zbMATH OpenFDO

Authors Josu Oca, Miquel Bofill, Cristina Borralleras

Publication date 27 August 2026

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2026.101145

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• An introduction to the planning domain definition language
• Concise finite-domain representations for PDDL planning tasks
• OMTPlan: A Tool for Optimal Planning Modulo Theories
• Planning as satisfiability: heuristics
• Planning for hybrid systems via satisfiability modulo theories
• STRIPS: A new approach to the application of theorem proving to problem solving
• The computational complexity of propositional STRIPS planning
• The fast downward planning system
• 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, Budapest, Hungary, March 29--April 6, 2008. Proceedings
• Tools and algorithms for the construction and analysis of systems. 28th international conference, TACAS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2--7, 2022. Proceedings. Pa

This page was built for publication: Efficient SMT formulations for classical planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320665)