Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Herky: High performance rewriting in RRL

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

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. Anantharaman, S., Hsiang, J.: (1990) Automated proofs of the Moufang identities in alternative rings. J. of Automated Reasoning 6: 79–109.

    Google Scholar 

  2. Christian, J.: (1989) Fast Knuth-Bendix completion: summary. Proc. of Third Intl. Conf. of Rewriting Techniques and Applications (RTA-89). Springer-Verlag LNCS 355, 548–510.

    Google Scholar 

  3. Jouannaud, J.P., Kirchner, H.: (1986) Completion of a set of rules modulo a set of equations. SIAM J. on Computing, 15:1155–1194.

    Google Scholar 

  4. Kapur, D., Zhang, H.: (1989) An overview of RRL: Rewrite Rule Laboratory. Proc. of the third International Conference on Rewriting Techniques and its Applications (RTA-89), April 1989, Chapel Hill, NC, Springer Verlag LNCS 355, 513–529.

    Google Scholar 

  5. McCune, B.: (1990) OTTER 2.0 users guide. ANL-90/9, Argonne National Laboratory, Argonue, IL.

    Google Scholar 

  6. Overbeek, R.: (1990) A proposal for a competition. Argonne National Laboratory, Argonne, IL.

    Google Scholar 

  7. Peterson, G.L.: (1990) Complete sets of reductions with constraints. Proc. of 10th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence Vol. 449. Springer-Verlag, Berlin, pp. 381–395

    Google Scholar 

  8. Stevens, R.L.: (1987) Some experimental in nonassociative ring theorem with an automated theorem prover. J. of Automated Reasoning 3: 221–221

    Google Scholar 

  9. Stickel, M.E.: (1985) Automated deduction by theory resolution. J. of Automated Reasoning 1: 333–355

    Google Scholar 

  10. Zhang, H.: (1991) Criteria of critical pair criteria: a practical approach and a comparative study. Submitted to J. of Automated Reasoning.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Iowa, 52242, Iowa City, IA, USA

    Hantao Zhang

Authors
  1. Hantao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H. (1992). Herky: High performance rewriting in RRL. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_206

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_206

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55602-2

  • Online ISBN: 978-3-540-47252-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation