61 search results - page 9 / 13 » A Clause-Based Heuristic for SAT Solvers |
104
Voted
JSAT
2008
14 years 11 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
GLVLSI
2003
IEEE
15 years 5 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
106
click to vote
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
110
click to vote
SAT
2009
Springer
15 years 6 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
DAC
2010
ACM
15 years 3 months ago
2010
ACM
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...