Planning under Incomplete Knowledge

We propose a new logic-based planning language, called K. Transitions between states of knowledge can be described in K, and the language is well suited for planning under incomplete knowledge. Nonetheless, K also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, proving to be very flexible. A planning system supporting K is implemented on top of the disjunctive logic programming system DLV. This novel systemallows for solving hard planning problems, including secure planning under incomplete initial states, which cannot be solved at all by other logic-based planning systems such as traditional satisfiability planners.

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

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

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

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

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

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

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

[8]  Donald Michie,et al.  Machine Intelligence 4 , 1970 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[24]  Victor W. Marek.  Book review: Formalizing Common Sense: Papers by John McCarthy edited by Vladimir Lifschitz (Ablex, 1990) , 1993, SGAR.

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

[26]  Vladimir Lifschitz,et al.  Formalizing Common Sense: Papers by John McCarthy , 1998 .

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

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

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

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

[31]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

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

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

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

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

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

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

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