Planning as Model Checking

The goal of this paper is to provide an introduction, with various elements of novelty, to the Planning as Model Checking paradigm.

[1]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[2]  Paolo Traverso,et al.  Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.

[3]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[4]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Giuseppe De Giacomo,et al.  Automata-Theoretic Approach to Planning for Temporally Extended Goals , 1999, ECP.

[6]  Stephan Merz,et al.  Model Checking , 2000 .

[7]  Paolo Traverso,et al.  A Logic for Acting, Sensing and Planning , 1995, IJCAI.

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

[9]  Sam Steel.  Action Under Uncertainty , 1994, J. Log. Comput..

[10]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[11]  Paolo Traverso,et al.  Strong Cyclic Planning Revisited , 1999, ECP.

[12]  Henry A. Kautz,et al.  BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .

[13]  Fausto Giunchiglia,et al.  NUSMV: A New Symbolic Model Verifier , 1999, CAV.

[14]  Paolo Traverso,et al.  Strong Planning in Non-Deterministic Domains Via Model Checking , 1998, AIPS.

[15]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[16]  Jan van Leeuwen,et al.  Formal models and semantics , 1990 .

[17]  Fausto Giunchiglia,et al.  Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.

[18]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[19]  Manuela M. Veloso,et al.  OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains , 1999, Artificial Intelligence Today.

[20]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[21]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[22]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[23]  Amy L. Lansky,et al.  Reactive Reasoning and Planning , 1987, AAAI.

[24]  Orna Grumberg,et al.  Research on Automatic Verification of Finite-State Concurrent Systems , 1987 .

[25]  Susanne Biundo-Stephan,et al.  A New Logical framework for Deductive Planning , 1993, IJCAI.

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

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