Skip to main content
SpringerLink
Log in

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

  • System Descriptions
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 355))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. J. Hsiang, M. Rusinowitch, K. Sakai, Complete set of inference rules for the cancellation laws, IJCAI 87, Milan, Italy, 1987

    Google Scholar 

  7. M.E. Stickel, A case study of theorem proving by the Knuth-Bendix method: Discovering that x3=x implies ring commutativity, 7th CADE, Springer-Verlag, LNCS Vol 170, pp248–258, 1984

    Google Scholar 

  8. J. Mzali, Methodes de filtrage equationnel et de preuve automatique de theoremes, Thesis, Université de Nancy, 1986

    Google Scholar 

  9. G. Peterson, M.E. Stickel, Complete sets of reductions for some equational theories, JACM Vol 28, pp 233–264, 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO, Dépt. Math-Info., Université d'Orléans, 45067, Orleans Cedex 02, France

    Siva Anantharaman

  2. Université Paris-Sud Orsay, L. R. I. Bât 490, 91405, Orsay Cedex, France

    Jieh Hsiang & Jalel Mzali

Authors
  1. Siva Anantharaman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jieh Hsiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jalel Mzali
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anantharaman, S., Hsiang, J., Mzali, J. (1989). SbReve2: A term rewriting laboratory with (AC)-unfailing completion. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_131

Download citation

  • DOI: https://doi.org/10.1007/3-540-51081-8_131

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51081-9

  • Online ISBN: 978-3-540-46149-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation