Sciweavers

142 search results - page 1 / 29
» On-the-Fly Clause Improvement
Sort
View
DAC
2007
ACM
14 years 5 months ago
On-The-Fly Resolve Trace Minimization
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
Ohad Shacham, Karen Yorav
CAV
2003
Springer
155views Hardware» more  CAV 2003»
13 years 8 months ago
An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic
Abstract. Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tab...
Marc Geilen
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 8 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
IJCAI
1997
13 years 6 months ago
Learning Short-Term Weights for GSAT
We investigate an improvement to GSAT which associates a weight with each clause. We change the objective function so that GSAT moves to assignments maximizing the weight of satis...
Jeremy Frank