UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
- 1 January 2005
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 43 (1-4) , 91-111
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Algorithms for Sat and Upper Bounds on Their ComplexityJournal of Mathematical Sciences, 2003
- A deterministic (2−2/(k+1))n algorithm for k-SAT based on local searchTheoretical Computer Science, 2002
- Local Search Algorithms for SAT: An Empirical EvaluationJournal of Automated Reasoning, 2000
- SAT Local Search Algorithms: Worst-Case StudyJournal of Automated Reasoning, 2000
- Random generation of test instances with controlled attributes1996
- On the greedy algorithm for satisfiabilityInformation Processing Letters, 1992
- A continuous approach to inductive inferenceMathematical Programming, 1992
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Efficient local search for very large-scale satisfiability problemsACM SIGART Bulletin, 1992
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985