An Efficient Unification Algorithm
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from the nondeterministic one, and a PASCAL implementation is given.
Abstract
article Open Access Share on An Efficient Unification Algorithm Authors: Alberto Martelli Istituto di Scienze della Informazione, Università di Torino, Corso M. d'Azeglio 42, I-10125 Torino, Italy Istituto di Scienze della Informazione, Università di Torino, Corso M. d'Azeglio 42, I-10125 Torino, ItalyView Profile , Ugo Montanari Istituto di Scienze della Informazione, Università di Pisa, Corso Italia 40, I-56100 Pisa, Italy Istituto di Scienze della Informazione, Università di Pisa, Corso Italia 40, I-56100 Pisa, ItalyView Profile Authors Info & Claims ACM Transactions on Programming Languages and SystemsVolume 4Issue 2pp 258–282https://doi.org/10.1145/357162.357169Published:01 April 1982Publication History 608citation4,441DownloadsMetricsTotal Citations608Total Downloads4,441Last 12 Months983Last 6 weeks111 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF