Linear temporal logic as an executable semantics for planning languages

Journal of Logic, Language and Information 16 (1):63-89 (2006)
  Copy   BIBTEX

Abstract

This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, Planning Domain Description Language with control Knowledge (PDDL-K), which allows one to specify a planning problem together with heuristic information that can be of help for both pruning the search space and finding better quality plans. The semantics of the language is given in terms of a translation into a set of LTL formulae. Planning is then reduced to “executing” the LTL encoding, i.e. to model search in LTL. The feasibility of the approach has been successfully tested by means of the system Pdk, an implementation of the proposed method.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Semipositive LTL with an Uninterpreted Past Operator.John Slaney - 2005 - Logic Journal of the IGPL 13 (2):211-229.
Defeasible linear temporal logic.Anasse Chafik, Fahima Cheikh-Alili, Jean-François Condotta & Ivan Varzinczak - 2023 - Journal of Applied Non-Classical Logics 33 (1):1-51.
Phase semantics for linear-time formalism.Norihiro Kamide - 2011 - Logic Journal of the IGPL 19 (1):121-143.
Back from the future.Andrea Masini, Lucio Vigano & Marco Volpe - 2010 - Journal of Applied Non-Classical Logics 20 (3):241-277.
Unification in linear temporal logic LTL.Sergey Babenyshev & Vladimir Rybakov - 2011 - Annals of Pure and Applied Logic 162 (12):991-1000.

Analytics

Added to PP
2009-01-28

Downloads
6 (#1,485,580)

6 months
46 (#95,336)

Historical graph of downloads
How can I increase my downloads?