428 search results - page 38 / 86 » FPGA-Based SAT Solver |
CP
2003
Springer
14 years 29 days ago
2003
Springer
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
AAAI
2008
13 years 10 months ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...