565 search results - page 1 / 113 » Heuristics for Planning with SAT |
117
click to vote
CP
2010
Springer
15 years 11 days ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
135
Voted
AUSAI
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
117
Voted
AI
2008
Springer
15 years 1 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
140
Voted
AIPS
2006
15 years 3 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
115
Voted
PRICAI
2010
Springer
15 years 6 days ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...