Computational complexity of planning with temporal goals

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 509-514

  Baral, Chitta ^a   Kreinovich, Vladik ^b   Trejo, Raúl A ^c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT EL PASO   (United States)

^c SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

FLUENTS; LINEAR TEMPORAL LOGIC; NP COMPLETE; PLANNING PROBLEM; PSPACE-COMPLETE; SEQUENCE OF ACTIONS;

ARTIFICIAL INTELLIGENCE; TEMPORAL LOGIC;

COMPUTATIONAL COMPLEXITY;

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

References (11)

1. Fahiem Bacchus and Froduald Kabanza. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence, 22:5-27, 1998.
2. Chitta Baral, Raúl Trejo, and Vladik Kreinovich. Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence, 122:241-267, 2000.
3. Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:161-204, 1994.
4. E. Allen Emerson. Temporal and modal logics. In: Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, Vol. B, pages 995-1072, MIT Press, Cambridge, Massachusetts, 1990.
5. Kuthulan Erol, Dana S. Nau, and V.S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1-2):75-88, 1995.
6. Dov M. Gabbay, Ian Hodkinson, and Mark Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects. Oxford University Press, New York, 1994.
7. Michael Gelfond and Vladimir Lifschitz. Representing actions and change by logic programs. Journal of Logic Programming, 17(2,3,4):301-323, 1993.
8. Paolo Liberatore. The complexity of the language A. Electronic Transactions on Artificial Intelligence, 1:13-28 (http://www.ep.liu.se/ej/etai/ 1997/02), 1997.
9. Michael L. Littman. Probabilistic propositional planning: representations and complexity. In AAAI 97, pages 748-754, 1997.
10. Rajdeep Niyogi and Sudeshna Sarkar. Logical specification of goals. In International Conference on Information Technology ICIT'2000, Bhubaneswar, India, December 21-23, 2000. Tata McGraw-Hill.
11. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, Massachusetts, 1994.