10 search results - page 2 / 2 » A SAT-based solver for Q-ALL SAT |
DAC
2006
ACM
14 years 12 days ago
2006
ACM
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
JSAT
2006
13 years 6 months ago
2006
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
IFIP
2001
Springer
13 years 11 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
ICCAD
2009
IEEE
13 years 4 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
SAT
2009
Springer
14 years 29 days ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...