565 search results - page 37 / 113 » Heuristics for Planning with SAT |
JAIR
2006
13 years 8 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
AIPS
2009
13 years 9 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
AIPS
2009
13 years 9 months ago
2009
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
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 ...