Automated proofs of equality problems in Overbeek's competition-Reference-Cited by-同舟云学术

Automated proofs of equality problems in Overbeek's competition

Published:1993 Issue:3 Volume:11 Page:333-351
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Zhang Hantao

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

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

Reference31 articles.

1. Anantharaman, S. and Hsiang, J., ?Automated proofs of the Moufang identities in alternative rings?,J. Automated Reasoning 6 79?109 (1990).

2. Bonacina, M. P., ?Problems in Lukasiewicz logic?,AAR Newsletter, No. 18 (1991).

3. Christian, J., ?Fast Knuth-Bendix completion: summary?,Proc. Third International Conference of Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 355, Springer-Verlag, pp. 548?610 (1989).

4. Dershowitz, N., ?Termination of rewriting?,J. Symbolic Computation 3 69?116 (1987).

5. Dershowitz, N. and Jouannaud, J. P., ?Rewriting systems?, in Leuven, V. (Ed.),Handbook of Theoretical Computer Science, North Holland (1990).

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

1. The TPTP problem library - CNF release v1.2.1;Journal of Automated Reasoning;1998

2. Recording and Analysing Knowledge-Based Distributed Deduction Processes;Journal of Symbolic Computation;1996-04

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

4. An overview of Rewrite Rule Laboratory (RRL);Computers & Mathematics with Applications;1995-01

5. DISCOUNT: A system for distributed equational deduction;Rewriting Techniques and Applications;1995