SbReve2: A term rewriting laboratory with (AC)-unfailing completion-Reference-Cited by-同舟云学术

SbReve2: A term rewriting laboratory with (AC)-unfailing completion

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

Author:

Anantharaman Siva,Hsiang Jieh,Mzali Jalel

Publisher

Springer Berlin Heidelberg

Link

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

Reference9 articles.

1. S. Anantharaman, J. Mzali, Unfaling Completion Modulo a set of Equations, Technical report, LRI, 1989

2. L. Bachmair, N. Dershowitz, D. Plaisted, Completion without failure, Proc. Coll. on Resolution of Equations in Algebraic Structures, Lakeway, Texas, 1987

3. R. Forgaard, J. Guttag, REVE: A term rewriting system generator with failure-resistant Knuth-Bendix, MIT-LCS technical report, 1984

4. J. Hsiang, J. Mzali, SbReve users guide, Technical report, LRI, 1988

5. J. Hsiang, M. Rusinowitch, On word problems in equational theories, 14th ICALP,Springer-Verlag LNCS Vol 267, pp54–71, 1987

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

1. Completion procedures as semidecision procedures;Conditional and Typed Rewriting Systems;1991

2. Automated deduction with associative commutative operators;Fundamentals of Artificial Intelligence Research;1991

3. Automated proofs of the moufang identities in alternative rings;Journal of Automated Reasoning;1990-03

4. Design and development of ENprover, an automated theorem proving system based on EN-strategy;Design and Implementation of Symbolic Computation Systems;1990

5. Heuristical criteria in refutational theorem proving;Design and Implementation of Symbolic Computation Systems;1990