UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (2002)
by
Edward A. Hirsch
,
Arist Kojevnikov
| Citations: | 54 - 1 self |
BibTeX
@MISC{Hirsch02unitwalk:a,
author = {Edward A. Hirsch and Arist Kojevnikov},
title = {UnitWalk: A new SAT solver that uses local search guided by unit clause elimination},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present a new randomized algorithm for SAT, i.e., the satisfiability problem for Boolean formulas in conjunctive normal form. Despite its simplicity, this algorithm performs well on many common benchmarks ranging from graph coloring problems to microprocessor verification.
