Decidability and Undecidability Results for Planning with Numerical State Variables

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 44-53

  Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BENCHMARK PROBLEMS; COMPUTATIONAL PROPERTIES; ENCODINGS; INTERNATIONAL PLANNING COMPETITIONS; PLANNING LANGUAGES; PLANNING PROBLEM; PLANNING TASKS; PROPOSITIONAL PLANNING; STATE-VARIABLES; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

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

References (16)

1. + planning. Computational Intelligence 11(4):625-655.
2. Bixby, R.; Fenelon, M.; Gu, Z.; Rothberg, E.; and Wunderling, R. 2000. MIP: Theory and practice - Closing the gap. In Powell, M. J. D., and Scholtes, S., eds., System Modelling and Optimization: Methods, Theory and Applications, volume 174 of International Federation for Information Processing. Kluwer Academic Press. 19-49.
3. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2):281-300.
4. Boolos, G. S., and Jeffrey, R. C. 1989. Computability and Logic. Cambridge University Press.
5. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1-2):165-204.
6. Cesta, A., and Borrajo, D., eds. 2001. Pre-proceedings of the Sixth European Conference on Planning (ECP'01).
7. Cutland, N. J. 1980. Computability - An Introduction to Recursive Function Theory. Cambridge University Press.
8. Do, M. B., and Kambhampati, S. 2001. Sapa: A domain-independent heuristic metric temporal planner. In Cesta and Borrajo (2001), 109-120.
9. Doherty, P., and Kvarnström, J. 2001. TALplanner: A temporal logic based planner. AI Magazine 22(3):95-102.
10. Edelkamp, S., and Helmert, M. 2001. The model checking integrated planning system (MIPS). AI Magazine 22(3):67-71.
11. Erol, K.; Nau, D. S.; and Subrahmanian, V. S. 1995. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76(1-2):65-88.
12. Fox, M., and Long, D. 2001. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Available at http://www.dur.ac.uk/d.p.long/competition.html.
13. Haslum, P., and Geffner, H. 2001. Heuristic planning with time and resources. In Cesta and Borrajo (2001), 121-132.
14. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
15. Matiyasevich, Y., and Senizerguez, G. 1996. Decision problems for semi-Thue systems with a few rules. In Proceedings of the Eleventh Annual Symposium on Logic in Computer Science (LICS'96), 523-531.
16. Nebel, B. 1999. What is the expressive power of disjunctive preconditions? In Fox, M., and Biundo, S., eds., Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99), volume 1809 of Lecture Notes in Artificial Intelligence, 294-307. New York: Springer-Verlag.