MPI-INF/SWS Research Reports 1991-2021

2. Number - only D2



Socher-Ambrosius, Rolf

February 1992, 10 pages.

Status: available - back from printing

Semi-unifiability is a generalization of both unification and matching. It is used to check nontermination of rewrite rules. In this paper an inference system is presented that decides semi-unifiability of two terms s and t and computes a semi-unifier. In contrast to an algorithm by Kapur, Musser et al, this inference system comes very close to the one for ordinary unification.

  • Attachement: (695 KBytes); MPI-I-92-207.pdf (61 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Socher-Ambrosius, Rolf},
  TITLE = {Semi-unification},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-207},
  MONTH = {February},
  YEAR = {1992},
  ISSN = {0946-011X},