62 search results - page 3 / 13 » On SAT instance classes and a method for reliable performanc... |
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
JSAT
2008
13 years 7 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
JAIR
2008
13 years 7 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
DATE
2002
IEEE
14 years 17 days ago
2002
IEEE
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
FMCAD
2004
Springer
13 years 11 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...