Universal Unification and Regular Equational ACFM Theories
Abstract
these theorems generate a complete minimal set of uni f iers (of matchers) and termination of the mat-ching algorithm is shown. For nonregular ACFM theories the matching algorithm may not terminate and we suspect that uniform ter-mination is unattainable. Since most known special purpose uni f icat ion algo-rithms are based on regular ACFM theories and since this class allows for a comparatively simple un i-versal un i f icat ion algorithm, we believe th is class may come to play a prominent role (simi lar to cer-ta in classes, l i ke SLR(l), in formal language theo-ry). On the other hand, the 'abstract ' universal algo-rithm does not represent a practical solution for
Cite
Text
Siekmann and Szabó. "Universal Unification and Regular Equational ACFM Theories." International Joint Conference on Artificial Intelligence, 1981.Markdown
[Siekmann and Szabó. "Universal Unification and Regular Equational ACFM Theories." International Joint Conference on Artificial Intelligence, 1981.](https://mlanthology.org/ijcai/1981/siekmann1981ijcai-universal/)BibTeX
@inproceedings{siekmann1981ijcai-universal,
title = {{Universal Unification and Regular Equational ACFM Theories}},
author = {Siekmann, Jörg H. and Szabó, Peter},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1981},
pages = {532-538},
url = {https://mlanthology.org/ijcai/1981/siekmann1981ijcai-universal/}
}