Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment
satisfying a given Boolean formula-is a fundamental intractable problem in computer …

An unsatisfiable set is a set of formulas whose conjunction is unsatisfiable. Every
unsatisfiable set can be corrected, ie, made satisfiable, by removing a subset of its members …

Satisfiability (SAT) solvers have become powerful tools to solve a wide range of
applications. In case SAT problems are satisfiable, it is easy to validate a witness. However …

In various areas of computer science, we deal with a set of constraints to be satisfied. If the
constraints cannot be satisfied simultaneously, it is desirable to identify the core problems …

Abstract Minimal Unsatisfiable Sets (MUSes) are useful in a number of applications.
However, in general there are many different MUSes, and each application might have …

Given an unsatisfiable formula F in CNF, ie a set of clauses, the problem of Minimal
Unsatisfiable Subset (MUS) seeks to identify a minimal subset of clauses N ⊆ F such that N …

The explanation of infeasibilities formed in Minimal Unsatisfiable Subformulas (MUSes) is a
core task in the analysis of over-constrained Boolean formulas. A wide range of applications …

Abstract Given an unsatisfiable Boolean Formula F in CNF, ie, a set of clauses, one is often
interested in identifying Maximal Satisfiable Subsets (MSSes) of F or, equivalently, the …

Recent advances have enabled powerful distributed SAT solvers to emit proofs of
unsatisfiability, which renders them as trustworthy as sequential solvers. However, this mode …

Satisfiability (SAT) solvers have become complex tools, which raises the question of whether
we can trust their results. This question is particularly important when the solvers are used to …