Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A constraint-based approach to narrow search trees for satisfiability
Information Processing Letters
A machine program for theorem-proving
Communications of the ACM
Investigations on autark assignments
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Space-Efficient Bounded Model Checking
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Complete local search for propositional satisfiability
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
Determinization of resolution by an algorithm operating on complete assignments
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Boundary Points and Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
SAT solving with reference points
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An overview of parallel SAT solving
Constraints
| Hi-index | 0.00 |
We describe a new decision-making procedure for resolutionbased SAT-solvers called Decision Making with a Reference Point (DMRP). In DMRP, a complete assignment called a reference point is maintained. DMRP is aimed at finding a change of the reference point under which the number of clauses falsified by the modified point is smaller than for the original one. DMRP makes it possible for a DPLL-like algorithm to perform a "local search strategy". We describe a SAT-algorithm with conflict clause learning that uses DMRP. Experimental results show that even a straightforward and unoptimized implementation of this algorithm is competitive with SAT-solvers like BerkMin and Minisat on practical formulas. Interestingly, DMRP is beneficial not only for satisfiable but also for unsatisfiable formulas.