Skip to main content
SpringerLink
Log in

KBlab: An equational theorem prover for the Macintosh

  • System Descriptions
  • Conference paper
  • First Online:
Book cover 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

References

  1. L.Bachmair, N.Dershowitz, J.Hsiang — Orderings for Equational Proofs In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, 346–357, Cambridge, MA, June 1986

    Google Scholar 

  2. L. Fribourg — A superposition oriented theorem prover J. of Theoretical Computer Science, Vol. 35, 129–164, 1985

    Google Scholar 

  3. L.Fribourg — A Strong Restriction to The Inductive Completion Procedure In Proceedings 13th Int. Conf. on Automata, Languages and Programming, Rennes, France, July 1986, Lecture Notes in Computer Science 226, 1986

    Google Scholar 

  4. Glickfield, R.Overbeek — A Foray Into Combinatory Logic J. of Automated Reasoning, Vol. 2, No. 4, Dec. 1986

    Google Scholar 

  5. J.Hsiang, M.Rusinowitch — On Word Problems in Equational Theories In Th.Ottman ed., Proceedings 14th Int. Conf. on Automata, Languages and Programming, Karlsrhue, W.Germany, July 1987, Lecture Notes in Computer Science 267, 1987

    Google Scholar 

  6. J.Hsiang, J.Mzali — SbREVE User's Guide To appear as Technical Report L.R.I. Universitè de Paris Sud, Orsay, France

    Google Scholar 

  7. G. Huet — A Complete Proof of Correctness of Knuth-Bendix Completion Algorithm J. of Computer and System Sciences, Vol. 23, 11–21, 1981

    Google Scholar 

  8. G. Huet, J.M. Hullot — Proofs by Induction in Equational Theories with Constructors J. of Computer and System Sciences, Vol. 25, 239–266, 1982

    Google Scholar 

  9. D.E. Knuth, P. Bendix — Simple Word Problems in Universal Algebras In J. Leech ed., Proceedings of the Conf. on Computational Problems in Abstract Algebras, Oxford, 1967, Pergamon Press, Oxford, 263–298, 1970

    Google Scholar 

  10. B.McCune, L.Wos — Some Fixed Points Problems in Combinatory Logic AAR Newsletter

    Google Scholar 

  11. A.Ohsuga, K.Sakai — Refutational Theorem Proving for Equational Systems Based on Term Rewriting Technical Report COMP86-40, ICOT, 1986

    Google Scholar 

  12. R. Smullyan — How to mock a mocking bird Alfred A. Knopf, New York 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell' Informazione, Università degli Studi di Milano, Via Moretto da Brescia 9, 20133, Milano

    Maria Paola Bonacina & Giancarlo Sanna

Authors
  1. Maria Paola Bonacina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giancarlo Sanna
    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

Bonacina, M.P., Sanna, G. (1989). KBlab: An equational theorem prover for the Macintosh. 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_135

Download citation

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

  • 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