{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:39:50Z","timestamp":1777646390810,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2000,3]]},"abstract":"<jats:p>Unification plays a central rule in Logic Programming. We \u201dsoften\u201d the unification process by admitting that two first order expressions can be \u201dsimilar\u201d 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 \u201dsound\u201d 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.<\/jats:p>","DOI":"10.3233\/fi-2000-41402","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:05:16Z","timestamp":1575324316000},"page":"393-414","source":"Crossref","is-referenced-by-count":31,"title":["Similarity-based Unification"],"prefix":"10.1177","volume":"41","author":[{"given":"Ferrante","family":"Formato","sequence":"first","affiliation":[{"name":"DMI University of Salerno, 84081 Baronissi (SA), Italy. formato@dia.unisa.it gerla@matna2.dma.unina.it mis@dia.unisa.it"}]},{"given":"Giangiacomo","family":"Gerla","sequence":"additional","affiliation":[{"name":"DMI University of Salerno, 84081 Baronissi (SA), Italy. formato@dia.unisa.it gerla@matna2.dma.unina.it mis@dia.unisa.it"}]},{"given":"Maria I.","family":"Sessa","sequence":"additional","affiliation":[{"name":"DMI University of Salerno, 84081 Baronissi (SA), Italy. formato@dia.unisa.it gerla@matna2.dma.unina.it mis@dia.unisa.it"}]}],"member":"179","published-online":{"date-parts":[[2000,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2000-41402","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2000-41402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:35:06Z","timestamp":1777444506000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2000-41402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["10.3233\/FI-2000-41402"],"URL":"https:\/\/doi.org\/10.3233\/fi-2000-41402","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1,1]]}}}