Skip navigation
Skip navigation

Planning as satisfiability with relaxed E-step plans

Wehrle, Martin; Rintanen, Jussi


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

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: AI 2007: 20th Australian Joint Conference on Artificial Intelligence Proceedings


File Description SizeFormat Image
01_Wehrle_Planning_as_satisfiability_2007.pdf219.34 kBAdobe PDF    Request a copy
02_Wehrle_Planning_as_satisfiability_2007.pdf283.63 kBAdobe PDF    Request a copy
03_Wehrle_Planning_as_satisfiability_2007.pdf278.23 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator