English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The Model Evolution Calculus with Equality

MPS-Authors
/persons/resource/persons44088

Baumgartner,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45125

Nieuwenhuis,  Robert
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Baumgartner, P., & Tinelli, C. (2005). The Model Evolution Calculus with Equality. In Automated deduction - CADE-20: 20th International Conference on Automated Deduction (pp. 392-408). New York, USA: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-27FF-9
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, MEE, 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 MEE uses an adapted version of the ordered paramodulation inference rule, where equations used for paramodulation 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 result is the refutational completeness of the MEE calculus.