KBlab: An equational theorem prover for the Macintosh

  • Maria Paola Bonacina
  • Giancarlo Sanna
System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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 1986Google Scholar
  2. [2]
    L. Fribourg — A superposition oriented theorem prover J. of Theoretical Computer Science, Vol. 35, 129–164, 1985Google Scholar
  3. [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, 1986Google Scholar
  4. [4]
    Glickfield, R.Overbeek — A Foray Into Combinatory Logic J. of Automated Reasoning, Vol. 2, No. 4, Dec. 1986Google Scholar
  5. [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, 1987Google Scholar
  6. [6]
    J.Hsiang, J.Mzali — SbREVE User's Guide To appear as Technical Report L.R.I. Universitè de Paris Sud, Orsay, FranceGoogle Scholar
  7. [7]
    G. Huet — A Complete Proof of Correctness of Knuth-Bendix Completion Algorithm J. of Computer and System Sciences, Vol. 23, 11–21, 1981Google Scholar
  8. [8]
    G. Huet, J.M. Hullot — Proofs by Induction in Equational Theories with Constructors J. of Computer and System Sciences, Vol. 25, 239–266, 1982Google Scholar
  9. [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, 1970Google Scholar
  10. [10]
    B.McCune, L.Wos — Some Fixed Points Problems in Combinatory Logic AAR NewsletterGoogle Scholar
  11. [11]
    A.Ohsuga, K.Sakai — Refutational Theorem Proving for Equational Systems Based on Term Rewriting Technical Report COMP86-40, ICOT, 1986Google Scholar
  12. [12]
    R. Smullyan — How to mock a mocking bird Alfred A. Knopf, New York 1985Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Maria Paola Bonacina
    • 1
  • Giancarlo Sanna
    • 1
  1. 1.Dipartimento di Scienze dell' InformazioneUniversità degli Studi di MilanoMilano

Personalised recommendations