Adventures in associative-commutative unification (A summary)-Reference-Cited by-同舟云学术

Adventures in associative-commutative unification (A summary)

Published: Issue: Volume: Page:358-367
ISSN:
Container-title:9th International Conference on Automated Deduction
language:
Short-container-title:

Author:

Lincoln Patrick,Christian Jim

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0012843

Reference18 articles.

1. Wolfram Büttner. “Unification in Datastructure Multisets”. Journal of Automated Reasoning, 2 (1986) 75–88.

2. Jim Christian and Pat Lincoln “Adventures in Associative-Commutative Unification” MCC Technical Report Number ACA-ST-275-87, Microelectronics and Computer Technology Corp., Austin, TX, Oct 1987.

3. François Fages. “Associative-Commutative Unification”. Proceedings 7th International Conference on Automated Deduction, Springer-Verlag. Lecture Notes in Computer Science, Napa Valley, (California), 1984.

4. Albrecht Fortenbacher. “An Algebraic Approach to Unification Under Associativity and Commutativity” Rewriting Techniques and Applications, Dijon, France, May 1985, ed Jean-Pierre Jouannaud. Springer-Verlag Lecture Notes in Computer Science Vol. 202, (1985) pp. 381–397

5. P. Gordan, “Ueber die Auflösung linearer Gleichungen mit reelen Coefficienten”. Mathematische Annalen, VI Band, 1 Heft (1873), 23–28.

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

1. Complexity and Algorithms for the Matching of Bag and Set Terms;Logics in Artificial Intelligence;2002

2. The complexity of weak unification of bounded simple set terms;Lecture Notes in Computer Science;1996

3. Unification of bounded simple set terms in deductive databases;Logic in Databases;1996

4. Set-term unification in a logic database language;Lecture Notes in Computer Science;1995

5. Set-term matching in logic programming;Database Theory — ICDT '92;1992