Planning via model checking in determistic domains: Preliminary report

  • Mauro Di Manzo
  • Enrico Giunchiglia
  • Simone Ruffino
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1480)


In this paper we report on SMV and NuSmv performances on a set of “model checking problems” variously generated starting from deterministic domain descriptions. The comparison with other state-of-the-art planning systems reveals that “planning via model checking” is a promising research line.


Planning & Temporal reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Allen, J. Hendler, and A. Tate (Eds.). Reading in planning. Morgan Kaufmann, 1990.Google Scholar
  2. 2.
    Anthony Barrett and Daniel S. Weld. Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence, July 1994.Google Scholar
  3. 3.
    Avrim Blum and Merrick Furst. Fast planning through planning graph analysis. In Proc. of IJCAI-95, pages 1636–1642, 1995.Google Scholar
  4. 4.
    A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. Nusmv: a reimplementation of Smv. In International Workshop on Software and Tools for Technology Transfer BRICS, Aalborg, Denmark, July 12–13, 1998. Technical Report 9801-06, IRST, Trento, Italy, January 1998.Google Scholar
  5. 5.
    A. Cimatti, E. Giunchiglia, F. Giunchiglia, and P. Traverso. Planning via Model Checking: A Decision Procedure for AR. In S. Steel and R. Alami, editors, Proceeding of the Fourth European Conference on Planning, number 1348 in Lecture Notes in Artificial Intelligence, pages 130–142, Toulouse, France, September 1997. Springer-Verlag. Also ITC-IRST Technical Report 9705-02, ITC-IRST Trento, Italy.Google Scholar
  6. 6.
    A. Cimatti, M. Roveri, and P. Traverso. Automatic OBDD-based Generation of Universal Plans in Non-Deterministic Domains. In Proceeding of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), July 26–30, 1998, Madison, Wisconsin.Google Scholar
  7. 7.
    A. Cimatti, M. Roveri, and P. Traverso. Strong Planning in Non-Deterministic Domains via Model Checking. In Proceeding of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS-98), Carnegie Mellon University, Pittsburgh, USA, June 1998. AAAI-Press.Google Scholar
  8. 8.
    E.M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop. Springer Verlag, May 1981. Lecture Notes in Computer Science No. 131.Google Scholar
  9. 9.
    James Crawford and Larry Auton. Experimental results on the crossover point in satisfiability problems. Artificial Intelligence, 81(1–2):31–58, 1996.MathSciNetCrossRefGoogle Scholar
  10. 10.
    Michael Ernst, Todd Millstein, and Daniel Weld. Automatic SAT-compilation of planning problems. In Proc. IJCAI-97, 1997.Google Scholar
  11. 11.
    R. E. Fikes and N. J. Nilsson. STRIPS: A new approach to the application of Theorem Proving to Problem Solving. Artificial Intelligence, 2(3–4):189–208, 1971.MATHCrossRefGoogle Scholar
  12. 12.
    Michael Gelfond and Vladimir Lifschitz. Representing actions in extended logic programming. In Krzysztof Apt, editor, Proc. Joint Int'l Conf. and Symp. on Logic Programming, pages 559–573, 1992.Google Scholar
  13. 13.
    Enrico Giunchiglia. Determining Ramifications in the Situation Calculus. In In Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), Cambridge, Massachusetts, November, 5–8 1996. Morgan Kaufmann Publishers.Google Scholar
  14. 14.
    Enrico Giunchiglia, G. Neelakantan Kartha, and Vladimir Lifschitz. Representing action: indeterminacy and ramifications. Artificial Intelligence, 95:409–443, 1997.MATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Cordell Green. Application of theorem proving to problem solving. In Proc. IJCAI, pages 219–240, 1969.Google Scholar
  16. 16.
    Steve Hanks and Drew McDermott. Nonmonotonic logic and temporal projection. Artificial Intelligence, 33(3):379–412, 1987.MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359–363, 1992.Google Scholar
  18. 18.
    Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic and stochastic search. In Proc. AAAI-96, pages 1194–1201, 1996.Google Scholar
  19. 19.
    Vladimir Lifschitz. Two components of an action language. Annals of Mathematics and Artificial Intelligence, 21:305–320, 1997.MATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    John McCarthy. Formalizing Common Sense: Papers by John McCarthy. Ablex, Norwood, NJ, 1990.Google Scholar
  21. 21.
    John McCarthy and Patrick Hayes. Some philosophical problems from the stand-point of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 4, pages 463–502. Edinburgh University Press, Edinburgh, 1969. Reproduced in [20].Google Scholar
  22. 22.
    Kenneth McMillan. Symbolic Model Checking. PhD thesis, Carnegie Mellon University, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Mauro Di Manzo
    • 1
  • Enrico Giunchiglia
    • 1
  • Simone Ruffino
    • 1
  1. 1.DISTUniversitá di GenovaGenovaItalia

Personalised recommendations