422 search results - page 23 / 85 » Multithreaded SAT Solving |
133
Voted
SAT
2004
Springer
15 years 7 months ago
2004
Springer
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
115
Voted
ICCAD
2006
IEEE
15 years 11 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
106
Voted
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an ...
150
click to vote
CP
2010
Springer
15 years 28 days ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
121
Voted
DATE
2000
IEEE
15 years 6 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...