Model Evolution with equality - Revised and implemented

  • Authors:

  • Peter Baumgartner;Björn Pelzer;Cesare Tinelli

  • Affiliations:

  • NICTA and The Australian National University, Canberra, Australia;Institute for Computer Science, Universität KoblenzLandau, Germany;Department of Computer Science, The University of Iowa, USA

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In many 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 Model Evolution calculus (ME), a first-order version of the propositional DPLL procedure. The new calculus, ME"E, is a proper extension of the ME calculus without equality. Like ME it maintains an explicit candidate model, which is searched for by DPLL-style splitting. For equational reasoning ME"E uses an adapted version of the superposition inference rule, where equations used for superposition are drawn (only) from the candidate model. The calculus also features a generic, semantically justified simplification rule which covers many simplification techniques known from superposition-style theorem proving. Our main theoretical result is the correctness of the ME"E calculus in the presence of very general redundancy elimination criteria. We also describe our implementation of the calculus, the E-Darwin system, and we report on practical experiments with it on the TPTP problem library.