Superposition and Model Evolution Combined

  • Peter Baumgartner
  • Uwe Waldmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5663)

Abstract

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 both—rather complementary—calculi in a single framework. For instance, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Nipkow, T.: Term Rewriting and all that. Cambridge University Press, Cambridge (1998)CrossRefMATHGoogle Scholar
  2. 2.
    Bachmair, L., Ganzinger, H.: Chapter 11: Equational Reasoning in Saturation-Based Theorem Proving. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction. A Basis for Applications. Foundations. Calculi and Refinements, vol. I, pp. 353–398. Kluwer, Dordrecht (1998)Google Scholar
  3. 3.
    Baumgartner, P., Tinelli, C.: The Model Evolution Calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Baumgartner, P., Tinelli, C.: The model evolution calculus with equality. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 392–408. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Nieuwenhuis, R., Rubio, A.: Theorem Proving with Ordering and Equality Constrained Clauses. Journal of Symbolic Computation 19, 321–351 (1995)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Weidenbach, C., Schmidt, R., Hillenbrand, T., Rusev, R., Topic, D.: System description: Spass version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 514–520. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Peter Baumgartner
    • 1
  • Uwe Waldmann
    • 2
  1. 1.NICTA and Australian National UniversityCanberraAustralia
  2. 2.MPI für InformatikSaarbrückenGermany

Personalised recommendations