|
201
|
BerkMin: a fast and robust sat-solver
– Evgueni Goldberg, Yakov Novikov
- 2002
|
|
909
|
Chaff: Engineering an Efficient SAT Solver
– Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
- 2001
|
|
926
|
A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
- 1960
|
|
287
|
GRASP - A New Search Algorithm for Satisfiability
– Joso L Marques Silva
- 1996
|
|
636
|
A machine program for theorem proving
– M Davis, G Logemann, D Loveland
- 1962
|
|
109
|
The Quest for Efficient Boolean Satisfiability Solvers
– Lintao Zhang, Sharad Malik
- 2002
|
|
244
|
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
– Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz
- 2001
|
|
19
|
Fifty-five solvers in Vancouver: The SAT 2004 competition
– Daniel Le Berre, Laurent Simon
- 2004
|
|
29
|
Zchaff2004: An efficient SAT solver
– Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik
- 2004
|
|
7
|
New Features of SAT’04 version of zChaff
– Zhaohui Fu, Yogesh Mahajan, Sharad Malik
- 2004
|
|
35
|
The impact of branching heuristics in propositional satisfiability algorithms
– João Marques-silva
- 1999
|
|
182
|
Using CSP look-back techniques to solve real-world SAT instances
– Roberto J. Bayardo
- 1997
|
|
141
|
Improvements To Propositional Satisfiability Search Algorithms
– Jon William Freeman
- 1995
|
|
2
|
The SMT-LIB web site
– Silvio Ranise, Cesare Tinelli
- 2004
|
|
10
|
Design and results of the 1st satisfiability modulo theories competition (SMT-COMP
– Clark Barrett, Leonardo De Moura, Aaron Stump
- 2005
|
|
318
|
Noise strategies for improving local search
– Bart Selman, Henry A. Kautz, Bram Cohen
- 1994
|
|
636
|
The complexity of theorem-proving procedures
– S Cook
- 1971
|
|
12
|
Tuning the VSIDS Decision Heuristic for Bounded Model Checking
– O Shacham, E Zarpas
- 2003
|
|
4
|
The SMT-LIB standard, version 1.1, 2005. Available from the ”Documents” section of http://combination.cs.uiowa.edu/smtlib
– Silvio Ranise, Cesare Tinelli
|
