20 search results - page 1 / 4 » On Approaches to Explaining Infeasibility of Sets of Boolean... |
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
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...
ECCC
2007
13 years 4 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
FROCOS
2009
Springer
13 years 8 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...