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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 355 LNCS, Issue , 1989, Pages 533-537

  Anantharaman, Siva ^a   Hsiang, Jieh ^b   Mzali, Jalel ^b  

^a UNIVERSITÉ D'ORLÉANS   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85032497605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51081-8_131     Document Type: Conference Paper

References (9)

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, pp 54-71, 1987
6. J. HSIANG, M. RUSINOWITCH, K. SAKAI, Complete set of inference rules for the cancellation laws, IJCAI 87, Milan, Italy, 1987
7. 3 - x implies ring commutativity, 7th CADE, Springer-Verlag, LNCS Vol 170, pp 248-258, 1984
8. J. MZALI, Méthodes de filtrage equationnel et de preuve automatique de theoremes, Thesis, Université de Nancy, 1986
9. G. PETERSON, M.E. STICKEL, Complete sets of reductions for some equational theories, JACM Vol 28, pp 233-264, 1981