Handling equality in logic programming via basic folding-Reference-Cited by-同舟云学术

Handling equality in logic programming via basic folding

Published:1996 Issue: Volume: Page:119-136
ISSN:0302-9743
Container-title:Extensions of Logic Programming
language:
Short-container-title:

Author:

Degtyarev Anatoli,Voronkov Andrei

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60983-0_8.pdf

Reference38 articles.

1. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In ACM Symposium on Principles of Programming Languages, pages 268–279, Portland, 1994.

2. L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In H. Aït Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2, pages 1–30. Academic Press, 1989.

3. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994.

4. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In D. Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 462–476, Saratoga Springs, NY, USA, June 1992. Springer Verlag.

5. G. Birkhoff. Subdirect unions in universal algebras. Bull. Amer. Math. Soc., 50:764–768, 1944.

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

1. On Arbitrary Selection Strategies for Basic Superposition;Logics in Artificial Intelligence;2006

2. Regular Derivations in Basic Superposition-Based Calculi;Logic for Programming, Artificial Intelligence, and Reasoning;2005

3. Handling equality in logic programming via basic folding;Extensions of Logic Programming;1996

4. What you always wanted to know about rigid E-unification;Logics in Artificial Intelligence;1996

5. Equality elimination for the tableau method;Design and Implementation of Symbolic Computation Systems;1996