An overview of Rewrite Rule Laboratory (RRL)-Reference-Cited by-同舟云学术

An overview of Rewrite Rule Laboratory (RRL)

Published:1989 Issue: Volume: Page:559-563
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Kapur Deepak,Zhang Hantao

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51081-8_138.pdf

Reference25 articles.

1. Dershowitz, N. (1987). Termination of rewriting. J. of Symbolic Computation.

2. Guttag, J.V., Kapur, D., Musser, D.R. (eds.) (1984). Proceedings of an NSF Workshop on the Rewrite Rule Laboratory Sept. 6–9 Sept. 1983, General Electric Research and Development Center Report 84GEN008.

3. Hsiang, J. (1985). Refutational theorem proving using term-rewriting systems. Artificial Intelligence Journal, 25, 255–300.

4. Hsiang, J., and Rusinowitch, M. (1986). “A new method for establishing refutational completeness in theorem proving,” Proc. 8th Conf. on Automated Deduction, LNCS No. 230, Springer Verlag, 141–152.

5. Jouannaud, J., and Kounalis, E. (1986). Automatic proofs by induction in equational theories without constructors. Proc. of Symposium on Logic in Computer Science, 358–366.

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

1. NuITP: An Inductive Theorem Prover for Equational Program Verification;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

2. Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification;Rewriting Logic and Its Applications;2020

3. MACE4 and SEM: A Comparison of Finite Model Generators;Automated Reasoning and Mathematics;2013

4. A Formalization of the Knuth–Bendix(–Huet) Critical Pair Theorem;Journal of Automated Reasoning;2010-01-21

5. On Duplication in Mathematical Repositories;Lecture Notes in Computer Science;2010