18 search results - page 2 / 4 » A Structure-Based Variable Ordering Heuristic for SAT |
101
click to vote
GLVLSI
2003
IEEE
15 years 7 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...
134
Voted
SAT
2009
Springer
15 years 8 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...
117
click to vote
DISOPT
2008
15 years 1 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
142
Voted
ICCAD
2001
IEEE
15 years 10 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
111
Voted
ICTAI
2002
IEEE
15 years 6 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...