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

Item

ITEM ACTIONSEXPORT

Released

Report

A refined version of general E-unification

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

Socher-Ambrosius,  Rolf
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-93-237.pdf
(Any fulltext), 150KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Socher-Ambrosius, R.(1993). A refined version of general E-unification (MPI-I-93-237). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B491-F
Abstract
Transformation--based systems for general E-unification were first investigated by Gallier and Snyder. Their system extends the well--known rules for syntactic unification by Lazy Paramodulation, thus coping with the equational theory. More recently, Dougherty and Johann improved on this method by giving a restriction of the Lazy Paramodulation inferences. In this paper, we show that their system can be further improved by a stronger restriction on the applicability of Lazy Paramodulation. It turns out that the framework of proof transformations provides an elegant and natural means for proving completeness of the inference system.