This paper describes a new architecture for first-order resolution and superposition theorem
provers called AVATAR (Advanced Vampire Architecture for Theories and Resolution). Its …

Superposition-based provers have been successfully used to discharge proof obligations
stemming from proof assistants. However, many such obligations require induction to be …

The central concept of theorem designates a claim backed by an irrefutable argument that
follows formal rules, called a proof. Proving theorems is very useful in both Computer …

Abstract Reasoning semantically in first-order logic is notoriously a challenge. This paper
surveys a selection of semantically-guided or model-based methods that aim at meeting …

Uniform interpolants have been largely studied in non-classical propositional logics since
the nineties; a successive research line within the automated reasoning community …

Verification of Data-Aware Processes via Satisfiability Modulo Theories Page 1 123 LNBIP 470
Verification of Data-Aware Processes via Satisfiability Modulo Theories Alessandro Gianola …

Abstract In ESOP 2008, Gulwani and Musuvathi introduced a notion of cover and exploited it
to handle infinite-state model checking problems. Motivated by applications to the …

Explicit theory axioms are added by a saturation-based theorem prover as one of the
techniques for supporting theory reasoning. While simple and effective, adding theory …

This paper introduces a new technique for reasoning with quantifiers and theories.
Traditionally, first-order theorem provers (ATPs) are well suited to reasoning with first-order …

We make a new contribution to the field by providing a new method of using SMT solvers in
saturation-based reasoning. We do this by introducing two new inference rules for reasoning …