Skip to main content
SpringerLink
Log in

An inductive theorem prover based on narrowing

  • System Descriptions
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

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

Abstract

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.

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. D. Duffy: Principles of Automated Theorem Proving. Wiley, 1991.

    Google Scholar 

  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. J. V. Guttag: The specification and application to programming of abstract data types. Ph. D. thesis, University of Toronto, Toronto, 1975.

    Google Scholar 

  4. U. S. Reddy: Term Rewriting Induction. CADE 10, Lecture Notes in Computer Science 249, Springer, 1990, pp. 162–177.

    Google Scholar 

  5. M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20, 1983, pp. 1–33

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bavarian Research Center for Knowledge Based Systems (FORWISS), Universität Passau, Postfach 2540, W-8390, Passau, Germany

    Ulrich Fraus

  2. Institut für Informatik, Technische Universität München, Postfach 20 24 20, W-8000, München 2, Germany

    Heinrich Hussmann

Authors
  1. Ulrich Fraus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heinrich Hussmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fraus, U., Hussmann, H. (1992). An inductive theorem prover based on narrowing. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013092

Download citation

  • DOI: https://doi.org/10.1007/BFb0013092

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation