33 search results - page 1 / 7 » The Boolean Constraint Solver of SWI-Prolog (System Descript... |
116
Voted
DATE
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...
116
Voted
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
131
click to vote
CSCLP
2004
Springer
15 years 6 months 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...
89
Voted
JSAT
2010
14 years 7 months ago
2010
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
104
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...