90 search results - page 6 / 18 » On the Structure of Industrial SAT Instances |
67
Voted
IBERAMIA
2004
Springer
15 years 3 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
80
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Work by Kilby, Slaney, Thiebaux and Walsh [1] showed that the backdoors and backbones of unstructured Random 3SAT instances are largely disjoint. In this work we extend t...
68
Voted
ISMIS
1999
Springer
15 years 1 months ago
1999
Springer
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
ICCD
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...