Abstract The Nelson–Oppen combination method is ubiquitous in Satisfiability Modulo
Theories solvers. However, one of its major drawbacks is to be restricted to disjoint unions of …

First-order logic has a long tradition and is one of the most prominent and most important
formalisms in computer science and mathematics. It is well-known that the satisfiability …

We present some decidability results for the universal fragment of theories modeling data
structures and endowed with arithmetic constraints. More precisely, all the theories taken …

Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in
automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable …

We present a modification of the superposition calculus that is meant to generate
explanations why a set of clauses is satisfiable. This process is related to abductive …

Formal verification techniques, such as deductive verification, require a logic-based tool
support to discharge proof obligations, in other words, satisfiability procedures. We design …

Abstract The Nelson-Oppen combination method is ubiquitous in Satisfiability Modulo
Theories solvers. However, one of its major drawbacks is to be restricted to disjoint unions of …

We present a modification of the Superposition Calculus that is meant to generate
consequences of sets of first-order axioms. This approach is proven to be sound and …

Generating the prime implicates of a formula consists in finding its most general
consequences. This has many fields of application in automated reasoning, like planning …

First-order linear rational arithmetic enriched with uninterpreted predicates yields an
interesting and very expressive modeling language. However, already the presence of a …