An inductive theorem prover based on narrowing

  • Ulrich Fraus
  • Heinrich Hussmann
System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 624)


This work presents a theorem prover for inductive proofs within an equational theory which supports the verification of universally quantified equations. This system, called TIP, is based on a modification of the well-known narrowing algorithm. Particulars of the implementation are stated and practical experiences are summarized. Finally some remarks on further extensions of the system are given.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Duffy: Principles of Automated Theorem Proving. Wiley, 1991.Google Scholar
  2. 2.
    U. Fraus, H. Hußmann: A Narrowing-Based Theorem Prover, in: Proceedings of the IMA/UCL Conference, C. Rattray & R. Clark (eds.), Oxford University Press, 1992.Google Scholar
  3. 3.
    J. V. Guttag: The specification and application to programming of abstract data types. Ph. D. thesis, University of Toronto, Toronto, 1975.Google Scholar
  4. 4.
    U. S. Reddy: Term Rewriting Induction. CADE 10, Lecture Notes in Computer Science 249, Springer, 1990, pp. 162–177.Google Scholar
  5. 5.
    M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20, 1983, pp. 1–33CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ulrich Fraus
    • 1
  • Heinrich Hussmann
    • 2
  1. 1.Bavarian Research Center for Knowledge Based Systems (FORWISS)Universität PassauPassauGermany
  2. 2.Institut für InformatikTechnische Universität MünchenMünchen 2Germany

Personalised recommendations