Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

In this article, we disprove a conjecture of Goemans and Linial; namely, that every negative
type metric embeds into ℓ1 with constant distortion. We show that for an arbitrarily small …

When a model does not satisfy a given specification, a counterexample is produced by the
model checker to demonstrate the failure. A user must then examine the counterexample …

The importance and impact of the Boolean satisfiability (SAT) problem in many practical
settings is well-known. Besides SAT, a number of computational problems related with …

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 …

Abstract Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical
applications, including product configuration, knowledge-based validation, and hardware …

We introduce an approach to detecting inconsistencies in large biological networks by using
answer set programming. To this end, we build upon a recently proposed notion of …

Advances and standards in Internet of Things (IoT) have simplified the realization of building
automation. However, non-expert IoT users still lack tools that can help them to ensure the …

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