Using SAT and logic programming to design polynomial-time algorithms for planning in non-deterministic domains

Chitta Baral, Thomas Eiter, Jicheng Zhao

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

2 Scopus citations

Abstract

We show that a Horn SAT and logic programming approach to obtain polynomial time algorithms for problem solving can be fruitfully applied to finding plans for various kinds of goals in a non-deterministic domain. We particularly focus on finding weak, strong, and strong cyclic plans for planning problems, as they are the most studied ones in the literature. We describe new algorithms for these problems and show how non-monotonic logic programming can be used to declaratively compute strong cyclic plans. As a further benefit, preferred plans among alternative candidate plans may be singled out this way. We give complexity results for weak, strong, and strong cyclic planning. Finally, we briefly discuss some of the kinds of goals in non-deterministic domains for which the approach in the paper can be used.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Pages578-583
Number of pages6
Volume2
StatePublished - 2005
Event20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05 - Pittsburgh, PA, United States
Duration: Jul 9 2005Jul 13 2005

Other

Other20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05
CountryUnited States
CityPittsburgh, PA
Period7/9/057/13/05

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Using SAT and logic programming to design polynomial-time algorithms for planning in non-deterministic domains'. Together they form a unique fingerprint.

  • Cite this

    Baral, C., Eiter, T., & Zhao, J. (2005). Using SAT and logic programming to design polynomial-time algorithms for planning in non-deterministic domains. In Proceedings of the National Conference on Artificial Intelligence (Vol. 2, pp. 578-583)