A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition

@inproceedings{Giese2002AMG,
  title={A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition},
  author={Martin Giese},
  booktitle={TABLEAUX},
  year={2002}
}
  • M. Giese
  • Published in TABLEAUX 30 July 2002
  • Mathematics
We present a calculus that integrates equality handling by superposition into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of the model generation [2,15] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [7]. 

Superposition-based Equality Handling for Analytic Tableaux

  • M. Giese
  • Mathematics
    Journal of Automated Reasoning
  • 2006
We present a variant of the basic ordered superposition rules to handle equality in an analytic free-variable tableau calculus. We prove completeness of this calculus by an adaptation of the model

The Hyper Tableaux Calculus with Equality

In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau

The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation

TLDR
This article shows how to integrate a modern treatment of equality in the hyper tableau calculus based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for superposition are drawn from a set of positive unit clauses, and superposition inferences into positive literals is restricted into (positive) unit clauses only.

Hyper Tableaux with Equality

TLDR
This paper shows how to integrate a modern treatment of equality in the hyper tableau calculus based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for paramodulation are drawn from a set of positive unit clauses, the candidate model.

Saturation Up to Redundancy for Tableau and Sequent Calculi

TLDR
This technique can be used to easily show the completeness of optimized calculi that contain destructive rules e.g. for simplification, rewriting with equalities, etc., which is not easily done with a standard Hintikka-style completeness proof.

Connection Tableaux with Lazy Paramodulation

  • A. Paskevich
  • Computer Science
    Journal of Automated Reasoning
  • 2007
TLDR
This paper presents a new connection tableau calculus for logic with equality based on a lazy form of paramodulation where parts of the unification step become auxiliary subgoals in a tableau and may be subjected to subsequent paramodulations.

The Disconnection Tableau Calculus

  • R. LetzG. Stenz
  • Mathematics, Computer Science
    Journal of Automated Reasoning
  • 2006
TLDR
This paper gives a comprehensive presentation of the disconnection tableau calculus, a proof method for formulas in classical first-order clause logic that uses unification in such a manner that important proof-theoretic advantages of the classical tableAU calculus are preserved.

Integration of Equality Reasoning into the Disconnection Calculus

TLDR
The disconnection tableau calculus represents a new confluent framework well suited for the integration of a large class of different methods for equality handling, as demonstrated in this paper.

The Model Evolution Calculus

TLDR
In addition to being a more faithful lifting of the DPLL procedure, the new calculus contains a more systematic treatment of universal literals, one of FDPLL’s optimizations, and so has the potential of leading to much faster implementations.

The model evolution calculus as a first-order DPLL method

References

SHOWING 1-10 OF 18 REFERENCES

Hyper Tableaux The Next Generation

TLDR
An improvement is introduced which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses, now replaced by a unification-driven technique.

Incremental Closure of Free Variable Tableaux

TLDR
This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking, and a way of organizing the search for closing instantiations that avoids this inefficiency.

Hyper Tableau - The Next Generation

TLDR
An improvement is introduced which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses, and is now replaced by a unification-driven technique.

Solution of the Robbins Problem

  • W. McCune
  • Mathematics
    Journal of Automated Reasoning
  • 2004
TLDR
This article shows that the three equations known as commutativity, association, and the Robbins equation are a basis for the variety oflean algebras and presents the proof and the search strategies that enabled the program EQP to find the proof.

Basic Paramodulation

TLDR
It is proved that refutational completeness in the context of deletion rules, such as simplification by rewriting and subsumption, and of techniques for eliminating redundant inferences, is complete without paramodulation into variables or using functional reflexivity axioms.

The Undecidability of Simultaneous Rigid E-Unification

Paramodulation with Built-in AC-Theories and Symbolic Constraints

TLDR
In the AC-case developed here, the computation of the (doubly exponentially many) AC-unifiers can thus be completely avoided and the results are applied here to more efficient strategies in theories expressed by finitesaturatedsets of clauses.

What You Always Wanted to Know about Rigid E-Unification

TLDR
A complete proof procedure for first-order logic with equality based on an incomplete but terminating procedure for rigid E-unification is defined.

Resolution Theorem Proving

Tableaux and Related Methods