137 search results - page 20 / 28 » Heuristic Backtracking Algorithms for SAT |
253
click to vote
AAAI
1994
15 years 8 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
217
Voted
CAV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
210
Voted
AAAI
2008
15 years 9 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
166
Voted
CONSTRAINTS
2007
15 years 7 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
182
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...