Using linear temporal logic to model and solve planning problems

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

Volumn 1480 LNAI, Issue , 1998, Pages 141-152

  Cerrito, Serenella ^a   Mayer, Maxta Cialdea ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS; COMPUTER CIRCUITS; SPECIFICATION LANGUAGES; SPECIFICATIONS;

EXPRESSIVE POWER; LINEAR TEMPORAL LOGIC; MODEL CONSTRUCTION; PLAN SYNTHESIS; PLANNING AS SATISFIABILITY; PLANNING PROBLEM; SEARCH STRATEGIES; SIMPLE MODELING;

TEMPORAL LOGIC;

EID: 21344467068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057441     Document Type: Conference Paper

References (16)

1. F. Bacchus and F. Kabanza. Using temporal logic to control search in a forward chaining planner. In Proc. of the TIME-95 International Workshop on Temporal Representation and Reasoning, Melbourne, Florida, April 1995.
2. Fahiem Bacchus and Froduald Kabanza. Planning for temporally extended goals. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 1215-1222. AAAI Press / The MIT Press, 1996.
3. H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. METATEM: a framework for programming in temporal logic. In Proc. of REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS. Springer, 1989.
4. H. Barringer, M. Fisher, D. Gabbay, and A. Hunter. Meta-reasoning in executable temporal logic. In Proc. of the Second Int. Conf. on Principles of Knowledge Representation and Reasoning, 1991.
5. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
6. S. Cerrito and M. Cialdea Mayer. TabPlan: Planning in linear temporal logic. Technical Report 1141, University de Paris Sud, Laboratoire de Recherche en In-formatique, 1997.
7. S. Cerrito and M. Cialdea Mayer. Bounded model search in linear temporal logic and its application to planning. In H. De Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods, number 1397 in LNAI, pages 124-140. Springer, 1998.
8. A. Cesta and A. Oddi. DDL.l: a formal description of a constraint representaton language for physical domains. In M. Ghallab and A. Milani, editors, New Direction in AI Planning, pages 341-352. IOS Press, 1996.
9. K. Currie and A. Tate. O-Plan: the open planning architecture. Journal of Artificial Intelligence, 52:49-86, 1991.
10. H. Kautz, D. McAllester, and B. Selman. Encoding plans in propositional logic. In Proc. of the 5th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'96), pages 374-384, 1996.
11. H. Kautz and B. Selman. Planning as satisfiability. In B. Neumann, editor, 10th European Conference on Artificial Intelligence (ECAI), pages 360-363. Wiley & Sons, 1992.
12. R. Reiter. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In V. Lifschitz, editor, Artificial Intelligence and mathematical theory of computation: Papers in honor of John McCarthy, pages 359-380. Academic Press, 1991.
13. P.H. Schmitt and J. Goubault-Larrecq. A tableau system for linear-time temporal logic. In E. Brinksma, editor, 3rd Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), LNCS. Springer Verlag, 1997.
14. J. Scott Penberthy and D.S Weld. UCPOP: A sound, complete, partial order planner for ADL. In Proc. of the Third Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'92), pages 103-114. Morgan Kauffman Publ., 1992.
15. B. Stephan and S. Biundo. Deduction based refinement planning. In B. Drabble, editor, Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pages 213-220. AAAI Press, 1996.
16. P. Wolper. The tableau method for temporal logic: an overview. Logique et Analyse, 28:119-152, 1985.