In defense of PDDL axioms

Abiteboul, 1995 1996 Apt, 1988, Towards a theory of declarative knowledge, 89 F. Bacchus, Subset of PDDL for the AIPS2000 planning competition, The AIPS-00 Planning Competition Committee, 2000 A. Barrett, D. Christianson, M. Friedman, C. Kwok, K. Golden, S. Penberthy, Y. Sun, D. Weld, UCPOP user's manual, Technical Report 93-09-06d, The University of Washington, Computer Science Department, 1995 Bertoli, 2002, Solving power supply restoration problems with planning via symbolic model checking, 576 B. Bonet, H. Geffner, GPT: A tool for planning with uncertainty and partial information. In: Proceedings IJCAI-01 Workshop on Planning under Uncertainty and Incomplete Information, 2001, pp. 82–87 B. Bonet, S. Thiébaux, GPT meets PSR, in: E. Giunchiglia, N. Muscettola, D. Nau (Eds.), Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-03), Trento, Italy, 2003, pp. 102–111 Brewka, 1993, How to do things with worlds: On formalizing actions and plans, J. Logic Comput., 3, 517, 10.1093/logcom/3.5.517 Cadoli, 1997, A survey on knowledge compilation, AI Comm., 10, 137 M. Cadoli, F.M. Donini, P. Liberatore, M. Schaerf, Comparing space efficiency of propositional knowledge representation formalism, in: [2], pp. 364–373 Chandra, 1981, Alternation, J. ACM, 28, 114, 10.1145/322234.322243 Dantsin, 2001, Complexity and expressive power of logic programming, ACM Comput. Surv., 33, 374, 10.1145/502807.502810 M. Davidson, M. Garagnani, Pre-processing planning domains containing language axioms, in: Proceedings of the 21st Workshop of the UK Planning and Scheduling SIG (PlanSIG-02), 2002, pp. 23–34 Edelkamp, 2003, Promela planning, 197 S. Edelkamp, J. Hoffmann, PDDL2.2: The language for the classical part of the 4th international planning competition, Technical Report 195, Albert-Ludwigs-Universität, Institut für Informatik, Freiburg, Germany, 2004 Erol, 1995, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence, 76, 75, 10.1016/0004-3702(94)00080-K Fox, 2003, PDDL2.1: An extension to PDDL for expressing temporal planning domains, J. Artificial Intelligence Res., 20, 61, 10.1613/jair.1129 Garagnani, 2000, A correct algorithm for efficient planning with preprocessed domain axioms, 363 Gazen, 1997, Combining the expressiveness of UCPOP with the efficiency of Graphplan, vol. 1348, 221 G. Gogic, H.A. Kautz, C.H. Papadimitriou, B. Selman, The comparative linguistics of knowledge representation, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Quebec, 1995, pp. 862–869 J. Gustafsson, P. Doherty, Embracing occlusion in specifying the indirect effects of actions, in: [2], pp. 87–98 Hoffmann, 2002, Local search topology in planning benchmarks: A theoretical analysis, 92 Hoffmann, 2001, The FF planning system: Fast plan generation through heuristic search, J. Artificial Intelligence Res., 14, 253, 10.1613/jair.855 Holzmann, 1997, The model checker Spin, IEEE Trans. Software Engrg., 23, 279, 10.1109/32.588521 Karp, 1982, Turing machines that take advice, Enseign. Math., 28, 191 Kautz, 1992, Forming concepts for fast inference, 786 Lifschitz, 1986, On the semantics of STRIPS, 1 F. Lin, Embracing causality in specifying the indirect effects of actions, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Quebec, 1995, pp. 1985–1993 Lloyd, 1984 N. McCain, H. Turner, A causal theory of ramifications and qualifications, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Quebec, 1995, pp. 1978–1984 D. McDermott, PDDL—the planning domain definition language, Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, 1998 D. Nau, Y. Cao, A. Lotem, H. Munoz-Avila, SHOP: Simple hierarchical ordered planner, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, Sweden, 1999, pp. 968–975 Nebel, 2000, On the compilability and expressive power of propositional planning formalisms, J. Artificial Intelligence Res., 12, 271, 10.1613/jair.735 Sandewall, 1994 Slaney, 2001, Blocks world revisited, Artificial Intelligence, 125, 119, 10.1016/S0004-3702(00)00079-5 Thiébaux, 2001, Supply restoration in power distribution systems—a benchmark for planning under uncertainty, 85 S. Thiébaux, J. Hoffmann, B. Nebel, In defence of PDDL axioms, in: G. Gottlob (Ed.), Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acapulco, Mexico, 2003, pp. 961–966 M.Y. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM Symposium on the Theory of Computation, 1982, pp. 137–146 S. Vorobyov, A. Voronkov, Complexity of nonrecursive programs with complex values, Technical Report MPI-I-97-2-010, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1997 M.S. Winslett, Reasoning about action using a possible models approach. In: Proceedings of the 7th National Conference of the American Association for Artificial Intelligence (AAAI-88), Saint Paul, MI, 1988, pp. 89–93