565 search results - page 33 / 113 » Heuristics for Planning with SAT |
SAT
2004
Springer
14 years 1 months ago
2004
Springer
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
IJCAI
2001
13 years 9 months ago
2001
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
AIPS
2006
13 years 9 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...