Completion for unification (Q1178701)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 22288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completion for unification |
scientific article; zbMATH DE number 22288 |
Statements
Completion for unification (English)
0 references
26 June 1992
0 references
This is an elaboration of a method of constructing unification algorithms for specific classes of equational theories proposed by the second author [Computing unification algorithms, Proc. 1st Symp. on Logic in Computer Science, Boston, 206-216 (1986)]. In particular, a completion procedure is developed which, if it terminates, transforms a set of linear axioms of a theory \(A\) into a presentation of \(A\) in ''resolvent'' form, from which a unification algorithm can be derived automatically.
0 references
merging
0 references
mutation
0 references
syntactic theory
0 references
unification
0 references
0.8144204616546631
0 references
0.812813937664032
0 references
