A Combined Superposition and Model Evolution Calculus

We present a new calculus for first-order theorem proving with equality, $ \mathcal{ME}+$Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality) by integrating their inference rules and redundancy criteria in a non-trivial way. The main motivation is to combine the advantageous features of these two rather complementary calculi in a single framework. In particular, Model Evolution, as a lifted version of the propositional DPLL procedure, contributes a non-ground splitting rule that effectively permits to split a clause into non variable disjoint subclauses. In the paper we present the calculus in detail. Our main result is its completeness under semantically justified redundancy criteria and simplification rules. We also show how under certain assumptions the model representation computed by a (finite and fair) derivation can be queried in an effective way.

[1]  Harald Ganzinger,et al.  Integrating Equational Reasoning into Instantiation-Based Theorem Proving , 2004, CSL.

[2]  David A. Plaisted,et al.  Ordered Semantic Hyper-Linking , 1997, Journal of Automated Reasoning.

[3]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[4]  Christoph Weidenbach,et al.  System Description: SpassVersion 3.0 , 2007, CADE.

[5]  Christopher Lynch,et al.  Combining Instance Generation and Resolution , 2009, FroCoS.

[6]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[7]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[8]  Harald Ganzinger,et al.  New directions in instantiation-based theorem proving , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[9]  Peter Baumgartner,et al.  The Model Evolution Calculus with Equality , 2005, CADE.

[10]  Peter Baumgartner Logical Engineering with Instance-Based Methods , 2007, CADE.

[11]  Henny B. Sipma,et al.  The Decidability of the First-Order Theory of Knuth-Bendix Order , 2005, CADE.

[12]  Peter Baumgartner,et al.  The Model Evolution Calculus , 2003, CADE.

[13]  H. Ganzinger,et al.  Equational Reasoning in Saturation-Based Theorem Proving , 1998 .

[14]  Robert Nieuwenhuis Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings , 2005, CADE.

[15]  Hubert Comon,et al.  Disunification: A Survey. , 1991 .

[16]  Jean-Louis Lassez,et al.  Computational logic: essays in honor of Alan Robinson , 1991 .

[17]  Konstantin Korovin Instantiation-Based Automated Reasoning: From Theory to Practice , 2009, CADE.

[18]  Konstantin Korovin,et al.  iProver - An Instantiation-Based Theorem Prover for First-Order Logic (System Description) , 2008, IJCAR.

[19]  Harald Ganzinger,et al.  Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[20]  Swen Jacobs,et al.  Comparing Instance Generation Methods for Automated Reasoning , 2005, TABLEAUX.