Planning as satisfiability with relaxed E-step plans
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
|Collections||ANU Research Publications|
|Source:||AI 2007: 20th Australian Joint Conference on Artificial Intelligence Proceedings|
|01_Wehrle_Planning_as_satisfiability_2007.pdf||219.34 kB||Adobe PDF||Request a copy|
|02_Wehrle_Planning_as_satisfiability_2007.pdf||283.63 kB||Adobe PDF||Request a copy|
|03_Wehrle_Planning_as_satisfiability_2007.pdf||278.23 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.