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

Authors:
Chitta Baral;Thomas Eiter;Jicheng Zhao
Affiliations:
Computer Science and Engineering, Arizona State University, Tempe, AZ;Institute of Information Systems, Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Computer Science and Engineering, Arizona State University, Tempe, AZ
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Year:
2005

Citing 6
Cited 1

Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Extending and implementing the stable model semantics

Artificial Intelligence
Planning with a language for extended goals

Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)

Maintenance goals of agents in a dynamic environment: Formulation and policy construction

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.