32 search results - page 4 / 7 » The Quest for Efficient Boolean Satisfiability Solvers |
DAC
2005
ACM
14 years 8 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...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
SIGSOFT
2000
ACM
13 years 11 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...