Computational complexity of planning based on partial information about the system's present and past states

Chitta Baral, Le Chi Tuan, Raul Trejo, Vladik Kreinovich

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Planning is a very important AI problem, and it is also a very time-consuming AI problem. To get an idea of how complex dif- ferent planning problems are, it is useful to describe the computational complexity of different general planning problems. This complexity has been described for problems in which planning is based on the (complete or partial) information about the current state of the system. In real-life planning problems, we can often complement the incompleteness of our explicit knowledge about the current state by using the implicit knowl- edge about this state which is contained in the description of the system's past behavior. For example, the information about the system's past fail- ures is very important in planning diagnostic and repair. To describe planning which can use the information about the past, a special lan- guage L was developed in 1997 by C. Baral, M. Gelfond and A. Provetti. In this paper, we expand the known results about computational com- plexity of planning (including our own previous results) to this more general class of planning problems.

Original languageEnglish (US)
Title of host publicationComputational Logic - CL 2000 - 1st International Conference, Proceedings
EditorsVeronica Dahl, Ulrich Furbach, Manfred Kerber, Catuscia Palamidessi, Peter J. Stuckey, Luís Moniz Pereira, Yehoshua Sagiv, John Lloyd, Kung-Kiu Lau
PublisherSpringer Verlag
Pages882-896
Number of pages15
ISBN (Electronic)3540677976, 9783540677970
StatePublished - Jan 1 2000
Event1st International Conference on Computational Logic, CL 2000 - London, United Kingdom
Duration: Jul 24 2000Jul 28 2000

Publication series

NameLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume1861
ISSN (Print)0302-9743

Other

Other1st International Conference on Computational Logic, CL 2000
CountryUnited Kingdom
CityLondon
Period7/24/007/28/00

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computational complexity of planning based on partial information about the system's present and past states'. Together they form a unique fingerprint.

  • Cite this

    Baral, C., Tuan, L. C., Trejo, R., & Kreinovich, V. (2000). Computational complexity of planning based on partial information about the system's present and past states. In V. Dahl, U. Furbach, M. Kerber, C. Palamidessi, P. J. Stuckey, L. M. Pereira, Y. Sagiv, J. Lloyd, & K-K. Lau (Eds.), Computational Logic - CL 2000 - 1st International Conference, Proceedings (pp. 882-896). (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science); Vol. 1861). Springer Verlag.