Similarity-based Unification

  • Authors:

  • Ferrante Formato;Giangiacomo Gerla;Maria I. Sessa

  • Affiliations:

  • DMI University of Salerno, 84081 Baronissi (SA), Italy. formato@dia.unisa.it gerla@matna2.dma.unina.it mis@dia.unisa.it;DMI University of Salerno, 84081 Baronissi (SA), Italy. formato@dia.unisa.it gerla@matna2.dma.unina.it mis@dia.unisa.it;(Correspd.: DMI University of Salerno, 84081 Baronissi (SA), Italy) DMI University of Salerno, 84081 Baronissi (SA), Italy. formato@dia.unisa.it gerla@matna2.dma.unina.it mis@dia.unisa.it

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Unification plays a central rule in Logic Programming. We ”soften” the unification process by admitting that two first order expressions can be ”similar” up to a certain degree and not necessarly identical. An extension of the classical unification theory is proposed accordingly. Indeed, in our approach, inspirated by the unification algorithm of Martelli-Montanari, the systems of equations go through a series of ”sound” transformations until a solvable form is found yielding a substitution that is proved to be a most general extended unifier for the given system of equations.