22 search results - page 2 / 5 » Incorporating Learning in Grid-Based Randomized SAT Solving |
AAAI
1997
13 years 6 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
JAIR
2008
13 years 4 months ago
2008
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
JAIR
2007
13 years 4 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...
CVPR
2003
IEEE
14 years 6 months ago
2003
IEEE
The performance of image retrieval with SVM active learning is known to be poor when started with few labelled images only. In this paper, the problem is solved by incorporating t...
FLAIRS
2007
13 years 7 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...