573 search results - page 1 / 115 » Planning as Satisfiability with Preferences |
LOGCOM
2011
12 years 10 months ago
2011
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...
AAAI
2007
13 years 10 months ago
2007
CONSTRAINTS
2010
13 years 5 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
AAAI
2006
13 years 9 months ago
2006
The importance of the problems of contingent planning with actions that have non-deterministic effects and of planning with goal preferences has been widely recognized, and severa...
AIPS
2004
13 years 9 months ago
2004
We address the issue of incorporating domain-specific preferences in planning systems, where a preference may be seen as a "soft" constraint that it is desirable, but no...