10 search results - page 1 / 2 » Integration of supercubing and learning in a SAT solver |
83
Voted
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
Abstract— Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Rece...
DAC
2005
ACM
16 years 1 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
143
Voted
FROCOS
2011
Springer
14 years 2 days ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
124
click to vote
JSAT
2006
15 years 10 days ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
126
Voted
FMCAD
2006
Springer
15 years 4 months ago
2006
Springer
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo T...