Sciweavers

68 search results - page 6 / 14
» Resolution Tunnels for Improved SAT Solver Performance
Sort
View
ICTAI
2002
IEEE
15 years 2 months ago
DSatz: A Directional SAT Solver for Planning
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
JAIR
2008
103views more  JAIR 2008»
14 years 9 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
14 years 7 months ago
Reduction of interpolants for logic synthesis
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...
John D. Backes, Marc D. Riedel
66
Voted
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 2 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
ICCD
2005
IEEE
114views Hardware» more  ICCD 2005»
15 years 6 months ago
State Set Management for SAT-based Unbounded Model Checking
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
Kameshwar Chandrasekar, Michael S. Hsiao