Hierarchic Superposition with Weak Abstraction

@inproceedings{Baumgartner2013HierarchicSW,
  title={Hierarchic Superposition with Weak Abstraction},
  author={Peter Baumgartner and Uwe Waldmann},
  booktitle={CADE},
  year={2013}
}
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… 
Hierarchic Superposition Revisited
TLDR
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 two new completeness results.
Hierarchic superposition with weak abstraction and the beagle theorem prover
TLDR
A new calculus, hierarchic superposition with weak abstraction, is devised which gives completeness for the clause logic fragment where all background-sorted terms are ground and includes a definition rule that is generally useful to find refutations more often.
Hierarchic Superposition: Completeness without Compactness
TLDR
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.
L O ] 1 7 A pr 2 01 9 Hierarchic Superposition Revisited ⋆
TLDR
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 two new completeness results.
Finite Quantification in Hierarchic Theorem Proving
TLDR
This paper presents a non-naive decision procedure for background theories extended this way on top of black-box decision procedures for the EA-fragment of the background theory, which employs a model-guided instantiation strategy for obtaining pure background formulas that are equi-satisfiable with the original formula.
Disproving in First-Order Logic with Definitions, Arithmetic and Finite Domains
TLDR
This thesis explores several methods which enable a first-order reasoner to conclude satisfiability of a formula modulo an arithmetic theory, including an implementation of that calculus (Beagle), including an optimized implementation of Cooper’s algorithm for quantifier elimination in the theory of linear integer arithmetic.
Superposition modulo theory
TLDR
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).
Superposition with First-class Booleans and Inprocessing Clausification
TLDR
A complete superposition calculus for first-order logic with an interpreted Boolean type to lay the foundation for refutationally complete calculi in more expressive logics with Booleans, and to make superposition work efficiently on problems that would be obfuscated when using clausification as preprocessing.
A Superposition Calculus for Abductive Reasoning
TLDR
A modification of the Superposition Calculus that is meant to generate consequences of sets of first-order axioms is presented, proven to be sound and deductive-complete in the presence of redundancy elimination rules.
Prime Implicate Generation in Equational Logic
TLDR
An algorithm for the generation of prime implicates in equational logic, of the most general consequences of formulae containing equations and disequations between first-order terms, is presented, defined by a calculus that is proved to be correct and complete.
...
...

References

SHOWING 1-10 OF 62 REFERENCES
Model Evolution with Equality Modulo Built-in Theories
TLDR
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
TLDR
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.
Refutational theorem proving for hierarchic first-order theories
TLDR
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.
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
TLDR
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.
Superposition Modulo Linear Arithmetic SUP(LA)
TLDR
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.
Theory Instantiation
TLDR
This paper shows how it is possible to combine the instantiation calculus with other calculi, such as ordered resolution and paramodulation, and proves completeness of the resulting calculus, provided that the theory reasoner is answer-complete and complete for reasoning with ground clauses.
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
TLDR
This work presents several decidable fragments of first order logic modulo theories, and shows how to construct models for satisfiable formulas in these fragments.
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
TLDR
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.
Rewrite-Based Equational Theorem Proving with Selection and Simplification
TLDR
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.
Superposition Decides the First-Order Logic Fragment Over Ground Theories
TLDR
It is shown that any clause set over the ground FOL(T) fragment can be transformed into a sufficiently complete one, and it is proved that SUP (T) terminates on the transformed clause set, hence constitutes a decision procedure provided the existential fragment of the theory T is decidable.
...
...