Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Much research in the area of constraint processing has recently been focused on extracting
small unsatisfiable “cores” from unsatisfiable constraint systems with the goal of finding …

Decision lists (DLs) find a wide range of uses for classification problems in Machine
Learning (ML), being implemented in anumber of ML frameworks. DLs are often perceived …

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

A variety of tasks in formal verification require finding small or minimal unsatisfiable cores
(subsets) of an unsatisfiable set of constraints. This paper proposes two algorithms for …

In the contexts of automated reasoning (AR) and formal verification (FV), important decision
problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last …

Declarative specifications exhibit a variety of problems, such as inadvertently
overconstrained axioms and underconstrained conjectures, that are hard to diagnose with …

In the contexts of automated reasoning and formal verification, important decision problems
are effectively encoded into Satisfiability Modulo Theories (SMT). In the last decade efficient …

We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper
exploration of resolution-refutation properties. We provide experimental results on formal …