144 search results - page 1 / 29 » Algorithms for Maximum Satisfiability using Unsatisfiable Co... |
DATE
2008
IEEE
13 years 6 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
JAR
2008
13 years 4 months ago
2008
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
DISOPT
2008
13 years 4 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...