Linear temporal logic as an executable semantics for planning languages

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.
Keywords Applied temporal logic  Artificial intelligence planning  Knowledge representation
Categories (categorize this paper)
Reprint years 2007
DOI 10.1007/s10849-006-9022-1
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,122
Through your library
References found in this work BETA
Some Philosophical Problems From the Standpoint of Artificial Intelligence.John McCarthy & Patrick Hayes - 1969 - In B. Meltzer & Donald Michie (eds.), Machine Intelligence 4. Edinburgh University Press. pp. 463--502.
The Tableau Method for Temporal Logic: An Overview.Pierre Wolper - 1985 - Logique Et Analyse 28 (110-111):119-136.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
21 ( #242,894 of 2,191,314 )

Recent downloads (6 months)
1 ( #290,783 of 2,191,314 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature