Sciweavers

238 search results - page 1 / 48
» Planning as Satisfiability
Sort
View
AUSAI
2007
Springer
13 years 8 months ago
Planning as Satisfiability with Relaxed $-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 a...
Martin Wehrle, Jussi Rintanen
AIPS
2006
13 years 6 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang
LOGCOM
2011
12 years 7 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
AAAI
2010
13 years 6 months ago
A Novel Transition Based Encoding Scheme for Planning as Satisfiability
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
ECAI
2004
Springer
13 years 8 months ago
Evaluation Strategies for Planning as Satisfiability
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...
Jussi Rintanen