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 …

Much effort is spent by programmers everyday in trying to reduce long, failing execution
traces to the cause of the error. We present an algorithm for error cause localization based …

The problem of enumerating minimal unsatisfiable subsets (MUSes) of an infeasible
constraint system is challenging due first to the complexity of computing even a single MUS …

Abstract Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real
world applications can be naturally encoded as such. Solving MaxSAT is an important …

Constrained optimization models are core tools in business, science, government, and the
military with applications including airline scheduling, control of petroleum refining …

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 …

Axiom pinpointing has been introduced in description logics (DLs) to help the user
understand the reasons why consequences hold by computing minimal subsets of the …

Axiom pinpointing has been introduced in description logics (DLs) to help the user to
understand the reasons why consequences hold and to remove unwanted consequences …

Methods for analyzing infeasible constraint sets have proliferated in the past decade,
commonly focused on finding maximal satisfiable subsets (MSSes) or minimal unsatisfiable …

In today's SoC design cycles, debugging is one of the most time consuming manual tasks.
CAD solutions strive to reduce the inefficiency of debugging by identifying error sources in …