Automata-theoretic approach to planning for temporally extended goals

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

Volumn 1809, Issue , 2000, Pages 226-238

  De Giacomo, Giuseppe ^a   Vardi, Moshe Y ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AUTOMATA-THEORETIC APPROACH; CONDITIONAL PLANS; INCOMPLETE INFORMATION; INFINITE WORD; INITIAL SITUATION; TEMPORAL PROPERTY; TRANSITION SYSTEM; WORST-CASE COMPLEXITY;

AUTOMATA THEORY;

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

References (47)

1. F.Bacchus, C.Boutilier, and A.Grove.Structured solution methods for nonmarkovian decision processes.In Proc.of AAAI'97, 112-117, 1997.
2. F.Bacchus and F.Kabanza.Planning for temporally extended goals.Ann.of Math.And AI, 22:5-27, 1998.
3. C.Backstrom.Equivalence and tractability results for SAS+ planning.In Proc.of KR'92, 1992.
4. M.Barbeau, F.Kabanza, and R.St-Denis.Synthesizing plant controllers using real-time goals.In Proc.of IJCAI'95, 791-798, 1995.
5. A.Blum and M.Furst.Fast planning through planning graph analysis.Artif.Intell., 90(1-2):281-300, 1997.
6. R.Bryant.Symbolic boolean manipulation with ordered binary-decision diagrams.ACM Computing Surveys, 24(3):293-318, 1992.
7. J.Burch, E.Clarke, K.McMillan, D.Dill, and L.Hwang.Symbolic model checking: 1020 states and beyond.Information and Computation, 98(2):142-170, 1992.
8. T.Bylander.Tractability and Artificial intelligence.J.of Experimental and Theoretical Computer Science, 3:171-178, 1991.
9. A.Cimatti, E.Giunchiglia, F.Giunchiglia, and P.Traverso.Planning via model checking.In Proc.of the ECP'97, 1997.
10. A.Cimatti, M.Roveri, and P.Traverso.Automatic OBDD-based generation of universal plans in non-deterministic domains.In Proc.of AAAI'98, 875-881, 1998.
11. T.H.Cormen, C.E.Leiserson, and R.L.Rivest.Introduction to Algorithms.The MIT Press, 1990.
12. M.Daniele and P.T.M.Y.Vardi.Strong cyclic planning revisited.submitted, 1999.
13. G.De Giacomo, L.Iocchi, D.Nardi, and R.Rosati.Moving a robot: The KR&R approach at work.In Proc.of KR'96, 1996.
14. A.Deshpande and P.Varaiya.Sementic tableau for control of PLTL formulae.In Proc.of the 35th Conf.on Decision and Control, 2243-2248.IEEE, 1996.
15. M.Drummond.Situated control rules.In Proc.of KR'89, 103-113, 1989.
16. E.Emerson.Temporal and modal logic.Handbook of Theoretical Computer Science, 997-1072, 1990.
17. O.Etzioni, S.Hanks, D.Weld, D.Draper, N.Lesh, and M.Williamson.An approach to planning with incomplete information.Proc.of KR'92, 1992.
18. R.Fikes and N.J.Nilsson.A new approach to the application of theorem proving to problem solving.Artif.Intell., 2(3/4), 1971.
19. M.R.Garey and D.S.Johnson.Computers and Intractability|A guide to NPcompleteness.W.H.Freeman and Company, San Francisco, 1979.
20. H.Gener.Classical, probabilistic and contingent planning: Three models, one algorithm.In Proc.AIPS'98 Work.on Planning as Combinatorial Search, 1998.
21. H.Gener and B.Bonet.High-level planning and control with incomplete information using POMDPs.In Proc.AIPS'98 Work.on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, 1998.
22. M.Gelfond and V.Lifschitz.Action languages.Linköping Electronic Articles in Computer and Information Science, 3(16), 1998.
23. K.Golden and D.S.Weld.Representing sensing actions: The middle ground revisited.Proc.of KR'96, 174-185, 1996.
24. R.Hardin, Z.Har'el, and R.Kurshan.COSPAN.In Computer Aided Verification, Proc.8th Int'l Conf, LNCS 1102, 423-427.Springer-Verlag, 1996.
25. D.Harel, O.Kupferman, and M.Y.Vardi.On the complexity of verifying concurrent transition systems.In Proc.8th Int'l Conf.on Concurrency Theory, LNCS 1243, 258-272, Warsaw, July 1997.Springer-Verlag.
26. G.Holtzmann.Tutorial: proving correctness of concurrent systems with spin.In Proc.6th Int'l Conf.on Concurrency Theory, 453-455.Springer-Verlag, 1995.
27. F.Kabanza, M.Barbeau, and R.St-Denis.Planning control rules for reactive agents.Artif.Intell., 95(1):67-113, 1997.
28. L.Kaelbling, M.L.Littman, and A.R.Cassandra.Planning and acting in partially observable stochastic domains.Artif.Intell., 101:99-134, 1998.
29. H.Kautz, D.McAllester, and B.Selman.Encoding plans in propositional logic.In Proc.of KR'96, 1996.
30. O.Kupferman and M.Y.Vardi.Synthesis with incomplete informatio.In 2nd Int'l Conf.on Temporal Logic, 91-106, Manchester, July 1997.Kluwer Academic Publishers.
31. R.Kurshan.Computer Aided Verification of Coordinating Processes.Princeton Univ.Press, 1994.
32. H.J.Levesque.What is planning in presence of sensing? In Proc.of AAAI'96, 1139-1149.AAAI Press/The MIT Press, 1996.
33. Z.Manna and R.J.Waldinger.How to clear a block: A theory of plans.J.of Automated Reasoning, 3(4), 1987.
34. J.McCarthy and P.Hayes.Some philosophical problems from the standpoint of Artificial intelligence.Machine Intelligence, 4:463-502, 1969.
35. K.McMillan.Symbolic Model Checking.Kluwer Academic Publishers, 1993.
36. E.Pednault.ADL: exploring the middle ground between STRIPS and the situation calculus.In Proc.of KR'89, 324-332, 1989.
37. A.Pnueli and R.Rosner.On the synthesis of a reactive module.In Proc.16th ACM Symp.on Principles of Programming Languages, Austin, January 1989.
38. P.Ramadge and W.Wonham.The control of discrete event systems.Proc.of IEEE, 77(1):81-98, Jan.1989.
39. R.Reiter.Knowledge in Action: Logical Foundation for Describing and Implementing Dynamical Systems.1998.In preparation.
40. S.J.Rosenschein.Plan synthesis: A logical perspective.In Proc.of IJCAI'81, 331-337, 1981.
41. E.Sandewall.Features and Fluents.The Representation of Knowledge about Dynamical Systems.Volume I.Oxford University Press, 1994.
42. M.Shanahan.Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia.The MIT Press, 1997.
43. M.Y.Vardi.An automata-theoretic approach to fair realizability and synthesis.In P.Wolper, editor, Computer Aided Verification, Proc.7th Int'l Conf., LNCS 939, 267-292.Springer-Verlag, Berlin, 1995.
44. M.Y.Vardi.An automata-theoretic approach to linear temporal logic.In F.Moller and G.Birtwistle, editors, Logics for Concurrency: Structure versus Automata, LNCS 1043, 238-266.Springer-Verlag, Berlin, 1996.
45. M.Y.Vardi and P.Wolper.An automata-theoretic approach to automatic program verification.In Proc.1st Symp.on Logic in Computer Science, 322-331, Cambridge, June 1986.
46. M.Y.Vardi and P.Wolper.Reasoning about in-nite computations.Information and Computation, 115(1):1-37, November 1994.
47. D.S.Weld and O.Etzioni.The First law of robotics (a call to arms).In Proc.of AAAI'94, 1042-1047, 1994.