Planning as satisfiability with relaxed E-step plans
Date
2007
Authors
Wehrle, Martin
Rintanen, Jussi
Journal Title
Journal ISSN
Volume Title
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
Description
Keywords
Keywords: Formal logic; Mathematical operators; Parallel processing systems; Semantics; Parallel operator applications; Planning problems; Relaxed semantics; Problem solving
Citation
Collections
Source
AI 2007: 20th Australian Joint Conference on Artificial Intelligence Proceedings
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31