In defense of PDDL axioms

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 961-966

  Thiebaux, Sylvie ^a   Hoffmann, Jorg ^b   Nebel, Bernhard ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN DESCRIPTION; ESSENTIAL FEATURES; REAL WORLD DOMAIN;

ARTIFICIAL INTELLIGENCE;

SEMANTICS;

EID: 84880817726     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufrnann, 1987.
2. F. Bacchus. Subset of PDDL for the AIPS2000 planning competition. www.es.toronto.edu/aips2 000, 2000.
3. A. Barrett, D. Christianson, M. Friedman, C. Kwok, K. Golden, S. Penberthy, Y. Sun, and D. Weld. UCPOP User's Manual. Technical Report 93-09-06d, The University of Washington, Computer Science Department, 1995.
4. B. Bonet and S. Thiebaux. GPT Meets PSR. In Proc. ICAPS. to appear, 2003.
5. A. K. Chandra, D. C. Kozcn, and L. J. Stockmcyer. Alternation. Journal of the ACM,2S(\):\\4-\33, 1981.
6. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Computing Surveys, 33(3):374-25, 2001.
7. M. Davidson and M. Garagnani. Pre-processing planning domains containing language axioms. In Proc. UK PlanSIG workshop, 2002.
8. M. Fox and D. Long. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. www.dur.ac.uk/d.p.long/IPC/pddl.html, 2002.
9. M. Garagnani. A correct algorithm for efficient planning with preproccssed domain axioms. In Research and Development in Intelligent Systems XVJJ. Springer, 2000.
10. C. Gazen and C. Knoblock. Combining the expressivity of UCPOP with the efficiency of Graphplan. In Proc. ECP, 1997.
11. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
12. R. M. Karp and R. J. Lipton. Turing machines that take advice. L' Enseignement Mathematique, 28:191 210, 1982.
13. H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. AAAI, 1992.
14. V. Lifschitz. On the semantics of STRIPS. In Proc. Workshop on Reasoning about Actions and Plans, pages 1-9, 1987.
15. J.Lloyd. Foundations of Logic Programming. Springer, 1993.
16. N. McCain and H. Turner. A causal theory of ramifications and qualifications. In Proc. IJCAI, 1995.
17. 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.
18. D. Nau, Y. Cao, A. Lotem, and H. Munoz-Avila. SHOP: simple hierarchical ordered planner. In Proc. IJCAI, 1999.
19. B. Nebel. On the compilability and expressive power of propositional planning formalisms. JAIR, 12:271-315, 2000.
20. M. Y. Vardi. The complexity of relational query languages. In Proc. STOC, 1982.