Computing infinite plans for LTL goals using a classical planner

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 2003-2008

  Patrizi, Fabio ^a   Lipoveztky, Nir ^b   De Giacomo, Giuseppe ^c   Geffner, Hector ^d  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d INSTITUCIÓ CATALANA DE RECERCA I ESTUDIS AVANÇATS ICREA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; PLANNING DOMAINS; STATE SEQUENCES;

ARTIFICIAL INTELLIGENCE;

AUTOMATA THEORY;

EID: 84879307989     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-334     Document Type: Conference Paper

References (20)

1. A. Albarghouthi, J. Baier, and S. McIlraith On the use of planning technology for verification. In Proc. ICAPS'09 Workshop VV&PS, 2009.
2. F. Bacchus and F. Kabanza. Planning for temporally extended goals. Ann. of Math. and AI, 22:5-27, 1998. (Pubitemid 128403997)
3. J.A. Baier and S.A. McIlraith. Planning with first-order temporally extended goals using heuristic search. In Proc. AAAI'06, 2006.
4. J.A. Baier, F. Bacchus, and S.A. McIlraith. A heuristic search approach to planning with temporally extended preferences. Art. Int., 173(5-6), 2009.
5. A. Bauer and P. Haslum. LTL goal specifications revisited. In Proc. ECAI'10, 2010.
6. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In Proc. CAV'02, 2002.
7. S. Cresswell and A. Coddington. Compilation of LTL goal formulas into PDDL. In Proc. ECAI'04, 2004.
8. G. De Giacomo and M. Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proc. ECP'99, 1999.
9. S. Edelkamp. Promela planning. In Proc. SPIN'03, 2003.
10. S. Edelkamp. On the compilation of plan constraints and preferences. In ICAPS'06, 2006.
11. B. Gazen and C. Knoblock. Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Proc. ECP'97, 1997.
12. A. Gerevini and D. Long. Plan constraints and preferences in PDDL3. Technical report, Univ. of Brescia, 2005.
13. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
14. F. Kabanza and S. Thiébaux. Search control in planning for temporally extended goals. In Proc. ICAPS'05, 2005.
15. A. Pnueli. The temporal logic of programs. In Proc. FOCS'77, 1977.
16. K. Y. Rozier and M. Y. Vardi. LTL satisfiability checking. STTT, 12(2):123-137, 2010.
17. V. Schuppan and A. Biere. Efficient reduction of finite state model checking to reachability analysis. STTT, 5(2-3):185-204, 2004.
18. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science. Elsevier, 1990.
19. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
20. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency, volume 1043 of LNCS. Springer, 1996.