573 search results - page 11 / 115 » Planning as Satisfiability with Preferences |
AAAI
1997
13 years 9 months ago
1997
Most work on AI planning has focused on the development of fully automated methods for generating plans that satisfy user-speci ed goals. However, users in many domains want the a...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
ECAI
2000
Springer
13 years 12 months ago
2000
Springer
Dynamic planning concerns the planning and execution of actions in a dynamic, real world environment. Its goal is to take into account changes generated by unpredicted events occur...
FLAIRS
2004
13 years 9 months ago
2004
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
FLAIRS
2008
13 years 10 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...