de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Book Chapter

Equational Reasoning in Saturation-Based Theorem Proving

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44055

Bachmair,  Leo
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bachmair, L., & Ganzinger, H. (1998). Equational Reasoning in Saturation-Based Theorem Proving. In W. Bibel, & P. H. Schmitt (Eds.), Automated Deduction: A Basis for Applications (pp. 353-397). Dordrecht, The Netherlands: Kluwer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3832-6
Abstract
In this chapter we describe the theoretical concepts and results that form the basis of state-of-the-art automated theorem provers for first-order clause logic with equality. We mainly concentrate on refinements of paramodulation, such as the superposition calculus, that have yielded the most promising results to date in automated equational reasoning.