In defense of PDDL axioms

Artificial Intelligence

Volumn 168, Issue 1-2, 2005, Pages 38-69

  Thiébaux, Sylvie ^a   Hoffmann, Jörg ^b   Nebel, Bernhard ^c  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Classical planning; Expressive power; PDDL

Indexed keywords

POLYNOMIALS; REAL TIME SYSTEMS; SEMANTICS;

CLASSICAL PLANNING; EXPRESSIVE POWER; PDDL;

ARTIFICIAL INTELLIGENCE;

EID: 25144449623     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.05.004     Document Type: Article

References (41)

1. S. Abiteboul, R. Hall, and V. Vianou Foundations of Databases 1995 Addison Wesley Reading, MA
2. L.C. Aiello J. Doyle S. Shapiro Principles of Knowledge Representation and Reasoning: Proceedings of the 5th International Conference (KR-96), Cambridge, MA 1996 Morgan Kaufmann San Mateo, CA
3. K. Apt, H. Blair, and A. Walker Towards a theory of declarative knowledge Foundations of Deductive Databases and Logic Programming 1988 Morgan Kaufmann San Mateo, CA 89 148
4. F. Bacchus, Subset of PDDL for the AIPS2000 planning competition, The AIPS-00 Planning Competition Committee, 2000
5. 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
6. P. Bertoli, A. Cimatti, J. Slaney, and S. Thiébaux Solving power supply restoration problems with planning via symbolic model checking Proceedings of the 15th European Conference on Artificial Intelligence (ECAI-02), Lyon, France 2002 Wiley New York 576 580
7. 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
8. 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
9. G. Brewka, and J. Hertzberg How to do things with worlds: On formalizing actions and plans J. Logic Comput. 3 5 1993 517 532
10. M. Cadoli, and F.M. Donini A survey on knowledge compilation AI Comm. 10 3-4 1997 137 150
11. M. Cadoli, F.M. Donini, P. Liberatore, M. Schaerf, Comparing space efficiency of propositional knowledge representation formalism, in: [2], pp. 364-373
12. A. Chandra, D. Kozen, and L. Stockmeyer Alternation J. ACM 28 1 1981 114 133
13. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov Complexity and expressive power of logic programming ACM Comput. Surv. 33 3 2001 374 425
14. 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
15. S. Edelkamp Promela planning Model Checking Software, 10th International SPIN Workshop 2003 Springer Berlin 197 212
16. 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
17. K. Erol, D.S. Nau, and V.S. Subrahmanian Complexity, decidability and undecidability results for domain-independent planning Artificial Intelligence 76 1-2 1995 75 88
18. M. Fox, and D. Long PDDL2.1: An extension to PDDL for expressing temporal planning domains J. Artificial Intelligence Res. 20 2003 61 124
19. M. Garagnani A correct algorithm for efficient planning with preprocessed domain axioms Research and Development in Intelligent Systems XVII 2000 Springer Berlin 363 374
20. B.C. Gazen, and C. Knoblock Combining the expressiveness of UCPOP with the efficiency of Graphplan S. Steel R. Alami Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Toulouse, France Lecture Notes in Artificial Intelligence vol. 1348 1997 Springer Berlin 221 233
21. 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
22. J. Gustafsson, P. Doherty, Embracing occlusion in specifying the indirect effects of actions, in: [2], pp. 87-98
23. J. Hoffmann Local search topology in planning benchmarks: A theoretical analysis M. Ghallab J. Hertzberg P. Traverso Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), Toulouse, France 2002 Morgan Kaufmann San Mateo, CA 92 100
24. J. Hoffmann, and B. Nebel The FF planning system: Fast plan generation through heuristic search J. Artificial Intelligence Res. 14 2001 253 302
25. G. Holzmann The model checker Spin IEEE Trans. Software Engrg. 23 5 1997 279 295
26. R.M. Karp, and R.J. Lipton Turing machines that take advice Enseign. Math. 28 1982 191 210
27. H.A. Kautz, and B. Selman Forming concepts for fast inference Proceedings of the 10th National Conference of the American Association for Artificial Intelligence (AAAI-92), San Jose, CA 1992 MIT Press Cambridge, MA 786 793
28. V. Lifschitz On the semantics of STRIPS M.P. Georgeff A. Lansky Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, Timberline, OR 1986 Morgan Kaufmann San Mateo, CA 1 9
29. 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
30. J.W. Lloyd Foundations of Logic Programming 1984 Springer Berlin
31. 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
32. 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
33. 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
34. B. Nebel On the compilability and expressive power of propositional planning formalisms J. Artificial Intelligence Res. 12 2000 271 315
35. E. Sandewall Features and Fluents 1994 Oxford University Press Oxford, UK
36. J. Slaney, and S. Thiébaux Blocks world revisited Artificial Intelligence 125 2001 119 153
37. S. Thiébaux, and M. Cordier Supply restoration in power distribution systems - a benchmark for planning under uncertainty A. Cesta D. Borrajo Recent Advances in AI Planning, 6th European Conference on Planning (ECP'01), Toledo, Spain 2001 Springer Berlin 85 95
38. 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
39. 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
40. 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
41. 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