100 search results - page 8 / 20 » sat 2005 |
ICCD
2005
IEEE
15 years 6 months ago
2005
IEEE
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...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
95
Voted
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...