The unification hierarchy is undecidable-Reference-Cited by-同舟云学术

The unification hierarchy is undecidable

Published:1991 Issue:3 Volume:7 Page:369-381
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Nutt Werner

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00249020.pdf

Reference16 articles.

1. Baader, F., ?The theory of idempotent semigroups is of unification type zero?, J. Automated Reasoning 2, 283?286 (1986).

2. Baader, F., personal communication, 1989.

3. Book, R. and Siekmann, J., ?On unification: equational theories are not bounded?, J. Symbolic Computation 2, 317?324 (1986).

4. Bürckert, H.-J., Herold, A. and Schmidt-Schauß, M., ?On equational theories, unification, and decidability?, Proc. 2nd Conference on Rewriting Techniques and Applications, LNCS 256, Springer, 1987, pp. 240?250. Also Kirchner, C. (Ed.), J. Symbolic Computation, Special Issue on Unification, 1989.

5. Kirchner, C. (Ed.), J. Symbolic Computation, Special Issue on Unification, 1989.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unification types of completely regular semigroups;Journal of Automated Reasoning;2002

2. Unification Theory;Handbook of Automated Reasoning;2001

3. Basics of Term Rewriting;Handbook of Formal Languages;1997

4. Combination problems for commutative/monoidal theories or how algebra can help in equational unification;Applicable Algebra in Engineering, Communication and Computing;1996-07

5. Combination problems for commutative/monoidal theories or how algebra can help in equational unification;APPL ALGEBR ENG COMM;1996