Yet Another Efficient Unification Algorithm
The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [3] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.
Code (1)
Similar Papers 제목 키워드 기반
Unification of Fusion Theories, Rules, Filters, Image Fusion and Target Tracking Methods (UFT)
The author has pledged in various papers, conference or seminar presentations, and scientific grant applications (between 2004-2015) for the unification of fusion theories, combinations of fusion rules, image fusion proc…
Superposition with Delayed Unification
Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferenc…
Defect Detection on Semiconductor Wafers by Distribution Analysis
A method for object classification that is based on distribution analysis is proposed. In addition, a method for finding relevant features and the unification of this algorithm with another classification algorithm is pr…
ClassificationDefect DetectionExtending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification
Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic $\mathcal{EL}$ to disunifica…
Nominal Unification and Matching of Higher Order Expressions with Recursive Let
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in nondeterministic polynomial time. We also explore specializations like nominal let…