Polynomial-length planning spans the polynomial hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424, Issue , 2002, Pages 111-124

  Turner, Hudson ^a  

^a UNIVERSITY OF MINNESOTA DULUTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; RECONFIGURABLE HARDWARE;

CLASSICAL PROPOSITIONAL LOGIC; CONDITIONAL PLANNING; PARTIAL OBSERVABILITY; PLANNING DOMAINS; POLYNOMIAL HIERARCHIES; POLYNOMIAL LENGTH; PROPOSITIONAL LOGIC; TRANSITION RELATIONS;

POLYNOMIALS;

EID: 77952044626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. Christer Bäckström and Bernhard Nebel. Complexity results for SAS+ planning. Computational Intelligence, 11(4):625-655, 1995.
2. Chitta Baral, Vladik Kreinovich, and Raul Trejo. Computational complexity of planning and approximate planning in presence of incompleteness. Artificial Intelligence, 122(1-2):241-267, 2000.
3. Tom Bylander. The computational complexity of propostional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
4. Giuseppe De Giacomo and Moshe Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proc. of 5th European Conf. on Planning, 1999.
5. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres. Planning under incomplete information. In Proc. Computational Logic 2000, 2000.
6. Kutluhan Erol, Dana S. Nau, and V.S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1-1):75-88, 1995.
7. Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623-630, 1998.
8. Patrik Haslum and Peter Jonsson. Some results on the complexity of planning with incomplete information. In Proc. of 5th European Conf. on Planning, 1999.
9. Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. of the 10th European Conf. on Artificial Intelligence, pages 359-379, 1992.
10. Michael Littman. Probabilistic propositional planning: representations and complexity. In Proc. of AAAI-97, pages 748-754, 1997.
11. Michael Littman, Judy Goldsmith, and Martin Mundhenk. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1-36, 1998.
12. Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. of AAAI-97, pages 460-465, 1997.
13. Christos Papadimitriou. Computational Complexity. Addison Wesley, 1994.
14. Jussi Rintanen. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.