Abstract
dc:descriptionEfficient unification is considered within the context of logic programming. Unification is explained in terms of equivalence classes made up of terms, where there is a constraint that no equivalence class may contain more than one function term. It is demonstrated that several well-known "efficient" but nonlinear unification algorithms continually maintain the said constraint as a consequence of their choice of data structure for representing equivalence classes. The linearity of the Paterson-Wegman unification algorithm is shown largely to be a consequence of its use of unbounded lists of pointers for representing equivalences between terms, which allows it to avoid the nonlinearity of "union-find".
Degree
thesis:*- Grantor dc:publisher
- University of North Texas
- Year dc:date
- 1989
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Wilbanks, John W. (John Winston)
- Contributors dc:contributor
-
- Yang, Chao-Chih
- Conrady, Denis A.
- Vlach, Frank
Subjects
dc:subject × 4Rights
dc:rights- Statement dc:rights
-
- Public
- Copyright
- Copyright is held by the author, unless otherwise noted. All rights reserved.
- Wilbanks, John W. (John Winston)
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
call-no: 379 N81 no. 6601
local-cont-no: 1002779080-Wilbanks
untcat: b1451345
oclc: 23019889
ark: ark:/67531/metadc500971