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 as satisfiability with relaxed E-step plans

Date

Authors

Wehrle, Martin

Rintanen, Jussi

Publisher

Springer

Abstract

Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator application based on ∃-step semantics. Operators can be applied in paralle

Keywords

Keywords: Formal logic; Mathematical operators; Parallel processing systems; Semantics; Parallel operator applications; Planning problems; Relaxed semantics; Problem solving

URI

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

Collections

ANU Research Publications

Source

AI 2007: 20th Australian Joint Conference on Artificial Intelligence Proceedings

Type

Conference paper

Restricted until

2037-12-31

Downloads

File

Description

01_Wehrle_Planning_as_satisfiability_2007.pdf (219.34 KB)

02_Wehrle_Planning_as_satisfiability_2007.pdf (283.63 KB)

03_Wehrle_Planning_as_satisfiability_2007.pdf (278.23 KB)