Planning via model checking: A decision procedure for AR

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1348 LNAI, Issue , 1997, Pages 130-142

  Cimatti, Alessandro ^a   Giunchiglia, Enrico ^b   Giunchiglia, Fausto ^a,c   Traverso, Paolo ^a  

^a ITC IRST   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH LEVEL LANGUAGES;

DECISION PROCEDURE; HARDWARE AND SOFTWARE; HIGH-LEVEL ACTION LANGUAGES; NEW APPROACHES; OPTIMAL SOLUTIONS; SYMBOLIC MODEL CHECKING; VIA MODELING;

MODEL CHECKING;

EID: 84898684942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_81     Document Type: Conference Paper

References (19)

1. Andrew Baker. Nonmonotonic reasoning in the framework of situation calculus. Artificial Intelligence, 49:5-23, 1991.
2. Avrim Blum and Merrick Furst. Fast planning through planning graph analysis. In Proc, of IJCAI-95, pages 1636-1642, 1995.
3. R. E. Bryant. Symbolic Boolean manipolation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
4. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and Hwang L.J. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2): 142-170, 1992.
5. E. Clarke, O. Grunberg, and D. Long. Model checking. In Proc. of the International Summer School on Deductive Program Design, Marktoberdorf, 1994.
6. Enrico Giunchiglia. Determining ramifications in the situation calculus. In Proc. of KR-96., 1996.
7. Enrico Giunchiglia, G. Neelakantan Kartha, and Vladimir Lifschitz. Representing action: Indeterminacy and ramifications. Artificial Intelligence, 1997.
8. To appear. Cordeil Green. Application of theorem proving to problem solving. In Proc. of IJCAI, pages 219-240, 1969.
9. J. Hertzberg and S. Thiebaux. Turning an Action Formalism into a Planner-A Case Study. Journal of Logic and Computation, 4(5):617-654, 1994.
10. Henry Kautz and Bart Selman. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search, In Proc. AAAI-96,1996.
11. Vladimir Lifschitz. Two components of an action language. In Working Papers of the Third Symposium on Logical Formalizations of Commonsense Reasoning, 1996.
12. Fangzhen Lin and Raymond Reiter. State constraints revisited. In Working Papers of the Second Symposium on Logical Formalizations of Commonsense Reasoning, 1993.
13. C. Pain-Barre and C. Schwind. Constructing Action Graphs for Planning. In European Workshop on Planning (EWPS95), pages 373-388. Malik Ghallab, 1995.
14. J. Penberthy and D. Weld. UCPOP: A sound, complete, partial order planner for adi. In Proc. of KR-92, 1992.
15. Stuart Russel. Efficient memory bounded search algorithms. In Proc. of ECAI-9Z, pages 1-5, 1992.
16. Erik Sandewall. Features and fluents: A systematic approach to the representation of knowledge about dynamical systems. Technical Report LiTH-IDA-R-92-30, Linköping University, 1992.
17. W. Stephan and S. Biundo. A New Logical Framework for Deductive Planning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-9S), pages 32-38. Morgan Kaufmann, 1993.
18. Manuela Veloso. Learning by analogical reasoning in general problem solving. PhD thesis, 1992. CMU, CS Techn. Report CMU-CS-92-174.
19. M. Winslett. Reasoning about actions with a possible models approach. In Proceedings of the 8th National Conference on Artificial Intelligence (IJCAI-93), pages 89-93, 1988.