Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
J. Allen, J. Hendler, and A. Tate (Eds.). Reading in planning. Morgan Kaufmann, 1990.
Anthony Barrett and Daniel S. Weld. Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence, July 1994.
Avrim Blum and Merrick Furst. Fast planning through planning graph analysis. In Proc. of IJCAI-95, pages 1636–1642, 1995.
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.
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.
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.
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.
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.
James Crawford and Larry Auton. Experimental results on the crossover point in satisfiability problems. Artificial Intelligence, 81(1–2):31–58, 1996.
Michael Ernst, Todd Millstein, and Daniel Weld. Automatic SAT-compilation of planning problems. In Proc. IJCAI-97, 1997.
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.
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.
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.
Enrico Giunchiglia, G. Neelakantan Kartha, and Vladimir Lifschitz. Representing action: indeterminacy and ramifications. Artificial Intelligence, 95:409–443, 1997.
Cordell Green. Application of theorem proving to problem solving. In Proc. IJCAI, pages 219–240, 1969.
Steve Hanks and Drew McDermott. Nonmonotonic logic and temporal projection. Artificial Intelligence, 33(3):379–412, 1987.
Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359–363, 1992.
Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic and stochastic search. In Proc. AAAI-96, pages 1194–1201, 1996.
Vladimir Lifschitz. Two components of an action language. Annals of Mathematics and Artificial Intelligence, 21:305–320, 1997.
John McCarthy. Formalizing Common Sense: Papers by John McCarthy. Ablex, Norwood, NJ, 1990.
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].
Kenneth McMillan. Symbolic Model Checking. PhD thesis, Carnegie Mellon University, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Manzo, M., Giunchiglia, E., Ruffino, S. (1998). Planning via model checking in determistic domains: Preliminary report. In: Giunchiglia, F. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 1998. Lecture Notes in Computer Science, vol 1480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057447
Download citation
DOI: https://doi.org/10.1007/BFb0057447
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64993-9
Online ISBN: 978-3-540-49793-6
eBook Packages: Springer Book Archive