565 search results - page 5 / 113 » Heuristics for Planning with SAT |
SAT
2004
Springer
14 years 1 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The past few years have seen significant progress in algorithms and heuristics for both SAT and symmetry detection. Additionally, the thesis that some of SAT's intra...
AAAI
1998
13 years 9 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
HVC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. HaifaSat is a new SAT solver that is based on a new decision heuristic called Clause-Move-To-Front (CMTF), a new resolutionbased scoring strategy and many other improveme...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...