Planning as model checking

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 1-20

  Giunchiglia, Fausto ^a,b   Traverso, Paolo ^a  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

MODEL CHECKING;

EID: 84943225005     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_1     Document Type: Conference Paper

References (27)

1. R.E.Bryant.Graph-Based Algorithms for Boolean Function Manipulation.IEEE Transactions on Computers, C-35(8):677-691, August 1986.
2. J.R.Burch, E.M.Clarke, K.L.McMillan, D.L.Dill, and L.J.Hwang.Sym-bolic Model Checking: 1020 States and Beyond.Information and Computation, 98(2):142-170, June 1992.
3. A.Cimatti, E.M.Clarke, F.Giunchiglia, and M.Roveri.NuSMV: A new Symbolic Model Verifier.In N.Halbwachs and D.Peled, editors, Proceedings Eleventh Con-ference on Computer-Aided Verification (CAV'99), number 1633 in Lecture Notes in Computer Science, pages 495-499, Trento, Italy, July 1999.Springer.
4. 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, Pro-ceeding 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.
5. A.Cimatti and M.Roveri.Conformant Planning via Model Checking.In Susanne Biundo, editor, Proceeding of the Fifth European Conference on Planning, Lec-ture Notes in Artificial Intelligence, Durham, United Kingdom, September 1999.Springer-Verlag.
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), Madison, Wisconsin, 1998.AAAI-Press.Also IRST-Technical Report 9801-10, Trento, Italy.
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.
8. E.Clarke, O.Grumberg, and D.Long.Model Checking.In Proceedings of the International Summer School on Deductive Program Design, Marktoberdorf, Ger-many, 1994.
9. E.M.Clarke and O.Grumberg.Research in automatic verification and nite-state concurrent systems.Annual Review of Computer Science, 2(1):269-289, 1987.
10. M.Daniele, P.Traverso, and M.Y.Vardi.Strong Cyclic Planning Revisited.In Susanne Biundo, editor, Proceeding of the Fifth European Conference on Plan-ning, Lecture Notes in Artificial Intelligence, Durham, United Kingdom, September 1999.Springer-Verlag.
11. G.de Giacomo and M.Y.Vardi.Automata-theoretic approach to planning with temporally extended goals.In Susanne Biundo, editor, Proceeding of the Fifth Eu-ropean Conference on Planning, Lecture Notes in Artificial Intelligence, Durham, United Kingdom, September 1999.Springer-Verlag.
12. E.A.Emerson.Temporal and modal logic.In J.van Leeuwen, editor, Hand-book of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 16, pages 995-1072.Elsevier, 1990.
13. 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.
14. M.George.An embedded reasoning and planning system.In J.Tenenberg, J.Weber, and J.Allen, editors, Proc.from the Rochester Planning Workshop: from Formal Systems to Practical Systems, pages 105-128, Rochester, 1989.
15. M.George and A.L.Lansky.Reactive reasoning and planning.In Proc.of the 6th National Conference on Artificial Intelligence, pages 677-682, Seattle, WA, USA, 1987.
16. F.Giunchiglia.Abstrips abstraction-Where do we stand? Technical Report 9607-10, ITC-IRST, Trento, Italy, July 1996.To appear 1999 in the Artificial Intelligence Review.
17. J.Y.Halpern and M.Y.Vardi.Model Checking vs.Theorem Proving: A Manifesto.In J.Allen, R.Fikes, and E.Sandewall, editors, Principles of Knowledge Represen-tations and Reasoning: Proceedings fo the Second International Conference, pages 325-334, 1991.
18. H.Kautz and B.Selman.BLACKBOX: A new approach to the application of theorem proving to problem solving.In Working notes of the AIPS-98 Workshop on Planning as Combinatorial Search, 1998.
19. Henry Kautz and Bart Selman.Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search.In Proc.AAAI-96, pages 1194-1201, 1996.
20. K.L.McMillan.Symbolic Model Checking.Kluwer Academic Publ., 1993.
21. J.Penberthy and D.Weld.UCPOP: A sound, complete, partial order planner for ADL.In Proc.of KR-92, 1992.
22. R.Jensen and M.Veloso.Obdd-based universal planning: Specifying and solving planning problems for synchronized agents in non-deterministic domains.Technical report, CMU, Carnegie Mellon University, USA, 1999.
23. M.J.Schoppers.Universal plans for Reactive Robots in Unpredictable Environ-ments.In Proc.of the 10th International Joint Conference on Artificial Intelli-gence, pages 1039-1046, 1987.
24. S.Steel.Action under Uncertainty.J.of Logic and Computation, Special Issue on Action and Processes, 4(5):777-795, 1994.
25. W.Stephan and S.Biundo.A New Logical Framework for Deductive Planning.In Proc.of IJCAI93, pages 32-38, 1993.
26. P.Traverso and L.Spalazzi.A Logic for Acting, Sensing and Planning.In Proc.of the 14th International Joint Conference on Artificial Intelligence, 1995.Also IRST-Technical Report 9501-03, IRST, Trento, Italy.
27. M.Y.Vardi and P.Wolper.An automata-theoretic approach to automatic program verification.In Proc.of LICS86, pages 332-344, 1986.