Fetching the paper…
Reading the bibliography…
Most classical planners use grounding as a preprocessing step, essentially reducing planning to propositional logic.
Complexity results for classes of quantificational formulas
Lewis, H. R. 1980 · 1980
Earlier work this paper cites.
The case for domain-specific frame axioms
Haas, A. R. 1987 · 1987
Earlier work this paper cites.
Planning as Satisfiability
Kautz, H. A.; and Selman, B. 1992 · 1992
Earlier work this paper cites.
Constructing Conditional Plans by a Theorem-Prover
Rintanen, J. 1999 · 1999
Earlier work this paper cites.
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
Rintanen, J. 2001 · 2001
Earlier work this paper cites.
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M.; and Long, D. 2003 · 2003
Earlier work this paper cites.
Automated Planning: theory and practice
Ghallab, M.; Nau, D.; and Traverso, P. 2004 · 2004
Earlier work this paper cites.
Bounded Model Checking with QBF
Dershowitz, N.; Hanna, Z.; and Katz, J. 2005 · 2005
Earlier work this paper cites.
Planning as satisfiability: parallel plans and algorithms for plan search
Rintanen, J.; Heljanko, K.; and Niemelä, I. 2006 · 2006
Earlier work this paper cites.
Compressing BMC Encodings with QBF
Jussila, T.; and Biere, A. 2007 · 2007
Cited alongside, same era.
Asymptotically optimal encodings of conformant planning in QBF
Rintanen, J. 2007 · 2007
Cited alongside, same era.
Regression for Classical and Nondeterministic Planning
Rintanen, J. 2008 · 2008
Cited alongside, same era.
Extending SAT Solvers to Cryptographic Problems
Soos, M.; Nohl, K.; and Castelluccia, C. 2009 · 2009
Cited alongside, same era.
Blocked Clause Elimination for QBF
Biere, A.; Lonsing, F.; and Seidl, M. 2011 · 2011
Cited alongside, same era.
The Fast Downward Planning System
Helmert, M. 2011 · 2011
Cited alongside, same era.
Planning with Effectively Propositional Logic
Navarro Pérez, J. A.; and Voronkov, A. 2013 · 2013
Later among the works it cites.
Madagascar: Scalable Planning with SAT
Rintanen, J. 2014 · 2014
Later among the works it cites.
Modeling Organic Chemistry and Planning Organic Synthesis
Masoumi, A.; Antoniazzi, M.; and Soutchanski, M. 2015 · 2015
Later among the works it cites.
CAQE: A Certifying QBF Solver
Rabe, M. N.; and Tentrup, L. 2015 · 2015
Later among the works it cites.
The RANTANPLAN planner: system description
Bofill, M.; Espasa, J.; and Villaret, M. 2016 · 2016
Later among the works it cites.
Exploring Organic Synthesis with State-ofthe-Art Planning Techniques
Matloob, R.; and Soutchanski, M. 2016 · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast Downward Stone Soup : A Baseline for Building Planner Portfolios
Helmert, M.; and Röger, G. 2011 · 2011
Cited alongside, same era.
Planning as Quantified Boolean Formula
Cashmore, M.; Fox, M.; and Giunchiglia, E. 2012 · 2012
Cited alongside, same era.
Partially Grounded Planning as Quantified Boolean Formula
Cashmore, M.; Fox, M.; and Giunchiglia, E. 2013 · 2013
Cited alongside, same era.
Towards lifted encodings for numeric planning in Essence Prime
Espasa, J.; Coll, J.; Miguel, I.; and Villaret, M. 2019 · 2019
Later among the works it cites.
Lifted Successor Generation Using Query Optimization Techniques
Corrêa, A. B.; Pommerening, F.; Helmert, M.; and Francès, G. 2020 · 2020
Later among the works it cites.