Hierarchic Superposition Revisited

  title={Hierarchic Superposition Revisited},
  author={Peter Baumgartner and Uwe Waldmann},
Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are “reasonably complete” even in the presence of free function symbols ranging into a background theory sort. The hierarchic superposition calculus of Bachmair, Ganzinger, and Waldmann already supports such symbols, but, as we demonstrate, not optimally. This paper aims to… 
A Comprehensive Framework for Saturation Theorem Proving (Technical Report)
This work presents a framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution or superposition, and relies on modular extensions of lifted redundancy criteria that extend redundancy criteria so that they cover subsumption.
A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic
It is proved that BS( SLR) clause sets with both universally and existentially quantified verification conditions (conjectures) can be translated into BS(SLR) clauses sets over a finite set of first-order constants.
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover
We present an Isabelle/HOL formalization of the first half of Bachmair and Ganzinger’s chapter on resolution theorem proving, culminating with a refutationally complete first-order prover based on
A Comprehensive Framework for Saturation Theorem Proving
A framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution or superposition, based on modular extensions of lifted redundancy criteria is presented.
J ul 2 02 1 Symbol Elimination for Parametric Second-Order Entailment Problems
We analyze possibilities of second-order quantifier elimination for formulae containing parameters – constants or functions. For this, we use a constraint resolution calculus obtained from
Symbol Elimination and Applications to Parametric Entailment Problems (Abstract)
This work identifies situations in which entailment between formulae expressed using secondorder quantification can be effectively checked and identifies the weakest constraints on parameters which guarantee satisfiability.
Deciding the Bernays-Schoenfinkel Fragment over Bounded Difference Constraints by Simple Clause Learning over Theories
SCL(T) is proved to be sound and refutationally complete for the combination of the the Bernays Schoenfinkel fragment with any compact theory and an abstract finite model property such that the size of a sufficiently large set of constants can be fixed a priori.
A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic
This paper improves the Datalog hammer in several ways: it generalizes it to mixed real-integer arithmetic and finite first-order sorts; it extends the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and it significantly reduces the size of the hammer output by a soft typing discipline.
Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover
  • Journal of Automated Reasoning
  • 2020


Hierarchic Superposition with Weak Abstraction
This paper introduces a novel form of clause abstraction, a core component in the hierarchic superposition calculus for transforming clauses into a form needed for internal operation, and argues for the benefits of the resulting calculus and provides a new completeness result for the fragment where all background-sorted terms are ground.
Hierarchic Superposition: Completeness without Compactness
An extension of hierarchic superposition is introduced and its completeness is proved for the fragment where every term of the background sort is ground and completeness for a larger fragment that admits variables in certain places is obtained.
Model Evolution with Equality Modulo Built-in Theories
A novel instantiation-based method for a large fragment of first-order logic with equality modulo a given complete background theory, such as linear integer arithmetic, is proposed.
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints
A novel calculus for a large fragment of first-order logic modulo Linear Integer Arithmetic (LIA) that overcomes several limitations of existing theory reasoning approaches and is amenable to strong redundancy criteria is proposed.
Superposition modulo theory
The Hierarchic Superposition calculus SUP(T) is significantly extended and new substantially more effective sufficient completeness and hierarchic redundancy criteria are introduced, enabling a fully automatic mechanism of reasoning about systems formalized in FOL(LA) or F OL(NLA).
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
A sequent calculus is introduced that combines ideas from free-variable constraint tableaux with the Omega quantifier elimination procedure and is complete for theorems of first-order logic and a substantial fragment of the combination of both.
Refutational theorem proving for hierarchic first-order theories
It is shown that superposition together with variable abstraction and constraint refutation is refutationally complete for theories that are sufficiently complete with respect to simple instances, and the concept of approximation between theorem proving systems is introduced.
Superposition Modulo Linear Arithmetic SUP(LA)
New effective versions for the standard superposition redundancy criteria taking the linear arithmetic theory into account are developed and the resulting calculus is implemented in SPASS(LA) and extends the state of the art in proving properties of first-order formulas over linear arithmetic.
Rewrite-Based Equational Theorem Proving with Selection and Simplification
This paper forms an abstract notion of redundancy and shows that the deletion of redundant clauses during the theorem proving process preserves refutation completeness, and presents various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses.
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
This work describes a theorem-proving method that tightly integrates superposition-based inference system and SMT solver and is refutationally complete if background theory symbols only occur in ground formulae, and non-ground clauses are variable-inactive.