565 search results - page 52 / 113 » Heuristics for Planning with SAT |
AIPS
2006
13 years 9 months ago
2006
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
ECOOP
2011
Springer
12 years 7 months ago
2011
Springer
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
AIPS
2010
13 years 10 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
AAAI
2008
13 years 10 months ago
2008
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...