Peter Baumgartner and Uwe Waldmann.
A Combined Superposition and Model Evolution Calculus.
Journal of Automated Reasoning, 47(2):191-227, August 2011.
Copyright Springer Verlag [ bib | DOI | .pdf ]
We present a new calculus for first-order theorem proving with equality, 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.

Peter Baumgartner and Cesare Tinelli.
Model Evolution with Equality Modulo Built-in Theories.
In Nikolaj Bjørner and Viorica Sofronie-Stokkermans, editors, CADE-23 - The 23nd International Conference on Automated Deduction, volume 6803 of Lecture Notes in Artificial Intelligence, pages 85-100. Springer, 2011.
Copyright Springer Verlag [ bib | .pdf ]
Many applications of automated deduction require reasoning modulo background theories, in particular some form of integer arithmetic. Developing corresponding automated reasoning systems that are also able to deal with quantified formulas has recently been an active area of research. We contribute to this line of research and propose 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. The new calculus is an extension of the Model Evolution Calculus with Equality, a first-order logic version of the propositional DPLL procedure, including its ordering-based redundancy criteria. We present a basic version of the calculus and prove it sound and (refutationally) complete under certain conditions.

Nikolaj Bjørner and Viorica Sofronie-Stokkermans, editors.
volume 6803 of Lecture Notes in Artificial Intelligence. Springer, 2011. [ bib ]