A logic programming approach to knowledge-state planning: Semantics and complexity

We propose a new declarative planning language, called K, which is based on principles and methods of logic programming. In this language, transitions between states of knowledge can be described, rather than transitions between completely described states of the world, which makes the language well suited for planning under incomplete knowledge. Furthermore, our formalism enables the use of default principles in the planning process by supporting negation as failure. Nonetheless, K also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, which shows that the language is very flexible. As we demonstrate on particular examples, the use of knowledge states may allow for a natural and compact problem representation. We then provide a thorough analysis of the computational complexity of K, and consider different planning problems, including standard planning and secure planning (also known as conformant planning) problems. We show that these problems have different complexities under various restrictions, ranging from NP to NEXPTIME in the propositional case. Our results form the theoretical basis for the DLVk system, which implements the language K on top of the DLV logic programming system.

[1]  di GenovaViale Causa.  Action Languages, Temporal Action Logics and the Situation Calculus , 1999 .

[2]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[3]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae , 1998, AAAI/IAAI.

[4]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[5]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[6]  Raymond Reiter,et al.  Open World Planning in the Situation Calculus , 2000, AAAI/IAAI.

[7]  Manuela Veloso.  Nonlinear problem solving using intelligent casual-commitment , 1989 .

[8]  Esra Erdem,et al.  Applications of Logic Programming to Planning: Computational Experiments , 1999 .

[9]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[10]  EiterThomas,et al.  A logic programming approach to knowledge-state planning, II , 2003 .

[11]  Burkhard Monien,et al.  A Distributed Algorithm to Evaluate Quantified Boolean Formulae , 2000, AAAI/IAAI.

[12]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[13]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[14]  Murray Shanahan,et al.  Prediction is Deduction but Explanation is Abduction , 1989, IJCAI.

[15]  Gregg Collins,et al.  Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[16]  Tran Cao Son,et al.  Formalizing sensing actions A transition function based approach , 2001, Artif. Intell..

[17]  Wolfgang Faber,et al.  Pushing Goal Derivation in DLP Computations , 1999, LPNMR.

[18]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[19]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[20]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[21]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[22]  Jussi Rintanen,et al.  Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[23]  Drew McDermott,et al.  A critique of pure reason 1 , 1987, The Philosophy of Artificial Intelligence.

[24]  Enrico Giunchiglia,et al.  Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism , 2000, KR.

[25]  Georg Gottlob,et al.  Succinctness as a Source of Complexity in Logical Formalisms , 1999, Ann. Pure Appl. Log..

[26]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[27]  Vladimir Lifschitz,et al.  On the Logic of Causal Explanation (Research Note) , 1997, Artif. Intell..

[28]  Marco Roveri,et al.  Recent Advances in AI Planning , 1999, Lecture Notes in Computer Science.

[29]  Vladimir Lifschitz,et al.  Representing Transition Systems by Logic Programs , 1999, LPNMR.

[30]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[31]  Jim Blythe,et al.  Decision-Theoretic Planning , 1999, AI Mag..

[32]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[33]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[34]  Kave Eshghi,et al.  Abductive Planning with Event Calculus , 1988, ICLP/SLP.

[35]  Gerald Jay Sussman,et al.  The virtuous nature of bugs , 1974 .

[36]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[37]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[38]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[39]  Hudson Turner,et al.  Polynomial-Length Planning Spans the Polynomial Hierarchy , 2002, JELIA.

[40]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[41]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[42]  Vladimir Lifschitz,et al.  Actions with Indirect Effects (Preliminary Report) , 1994, KR.

[43]  Amedeo Cesta,et al.  Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.

[44]  Axel Polleres.  The DLVK System for Planning with Incomplete Knowledge , 2001 .

[45]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[46]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[47]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[48]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[49]  David E. Smith,et al.  Extending Graphplan to Handle Uncertainty & Sensing Actions , 1998, AAAI/IAAI.

[50]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[51]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[52]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[53]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[54]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[55]  Hudson Turner,et al.  A Logic of Universal Causation , 1999, Artif. Intell..

[56]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[57]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[58]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[59]  Hudson Turner,et al.  A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.

[60]  Leon Sterling,et al.  Relating Stable Models and AI Planning Domains , 1995 .

[61]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[62]  Wolfgang Faber,et al.  Planning under Incomplete Knowledge , 2000, Computational Logic.

[63]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[64]  Robert P. Goldman,et al.  Expressive Planning and Explicit Knowledge , 1996, AIPS.

[65]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[66]  Marco Roveri,et al.  Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..

[67]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[68]  Enrico Giunchiglia,et al.  Causal Laws and Multi-Valued Fluents , 2001 .

[69]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[70]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[71]  Ross D. Shachter,et al.  Decision-theoretic planning , 1998 .

[72]  Saharon Shelah,et al.  Toward Categoricity for Classes with no Maximal Models , 1999, Ann. Pure Appl. Log..

[73]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[74]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[75]  Daniele Nardi,et al.  Planning with sensing, concurrency, and exogenous events: logical framework and implementation , 2000, KR.

[76]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[77]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[78]  Enrico Giunchiglia,et al.  Planning as Satisfiability in Nondeterministic Domains , 2000, AAAI/IAAI.

[79]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[80]  Carlo Zaniolo,et al.  Relating Stable Models and AI Planning Domains , 1995, ICLP.

[81]  Hudson Turner,et al.  Satisfiability planning with Causal Theories , 1998, KR.

[82]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[83]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[84]  Jürgen Dix,et al.  Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.

[85]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.