Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Planning for temporally extended goals as propositional satisfiability

Date

Authors

Mattmueller, Robert

Rintanen, Jussi

Publisher

Carnegie Mellon University

Abstract

Planning for temporally extended goals (TEGs) expressed as formulae of Linear-time Temporal Logic (LTL) is a proper generalization of classical planning, not only allowing to specify properties of a goal state but of the whole plan execution. Additionally

Keywords

Keywords: Classical planning; Domain specific; Linear time temporal logic; LTL model-checking; Partial ordering; Planning problem; Propositional satisfiability; SAT-based planning; Artificial intelligence; Problem solving

URI

http://hdl.handle.net/1885/29484

Collections

ANU Research Publications

Source

Proceedings of the International Joint Conference on Artificial Intelligence

Type

Conference paper

Restricted until

2037-12-31

Downloads

File

Description

01_Mattmueller_Planning_for_temporally_2007.pdf (43.92 KB)

02_Mattmueller_Planning_for_temporally_2007.pdf (25.91 KB)

03_Mattmueller_Planning_for_temporally_2007.pdf (355.62 KB)

04_Mattmueller_Planning_for_temporally_2007.pdf (233.08 KB)