73 search results - page 8 / 15 » The SAT 2005 Solver Competition on Random Instances |
CP
2005
Springer
13 years 9 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
CSCLP
2004
Springer
14 years 26 days ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
AAAI
2004
13 years 9 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...