Conflict-driven clause learning (CDCL) satisfiability solvers can emit more than a
satisfiability result; they can also emit clausal proofs, resolution proofs, unsatisfiable cores …

Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …

We describe LMHS, an open-source weighted partial maximum satisfiability (MaxSAT)
solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set …

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …

This work describes Sturgeon, a system for tile-based level generation using constraints. We
present a small mid-level constraint API that can be instantiated with various low-level …

We describe MaxPre, an open-source preprocessor for (weighted partial) maximum
satisfiability (MaxSAT). MaxPre implements both SAT-based and MaxSAT-specific …

Integration of the fields of constraint solving and data mining and machine learning has
recently been identified within the AI community as an important research direction with high …

In earlier work on a limited form of extended resolution for CDCL based SAT solving, new
literals were introduced to factor out parts of learned clauses. The main goal was to shorten …

There is extensive theoretical work on measures of inconsistency for arbitrary formulae in
knowledge bases. Many of these are defined in terms of the set of minimal inconsistent …

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 …