Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Generic induction proofs

  • Proof Techniques and Extensions of Conditional Rewriting
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 656))

Included in the following conference series:

  • 155 Accesses

Abstract

We summarize a number of new results concerning inductive-theorem proving in the area of design specifications using Horn logic with equality. Induction is explicit here because induction orderings must be integrated into the specification. However, the proofs need less guidance if the specification is ground confluent and strongly terminating. Calculi for verifying these conditions are presented along with a list of useful applications.

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. N. Dershowitz, J.-P. Jouannaud, Rewrite Systems, in: J. van Leeuwen, Handbook of Theoretical Computer Science, Elsevier (1990) 243–320

    Google Scholar 

  2. D. Duffy, Principles of Automated Theorem Proving, John Wiley & Sons 1991

    Google Scholar 

  3. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer 1985

    Google Scholar 

  4. P. Padawitz, Computing in Horn Clause Theories, Springer 1988

    Google Scholar 

  5. P. Padawitz, Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic programs, Journal of Automated Reasoning 7 (1991) 27–103

    Google Scholar 

  6. P. Padawitz, Reduction and Narrowing for Horn Clause Theories, The Computer Journal 34 (1991) 42–51

    Google Scholar 

  7. P. Padawitz, Deduction and Declarative Programming, Cambridge University Press 1992

    Google Scholar 

  8. P. Padawitz, EXPANDER: User's Manual, Universität Dortmund 1992

    Google Scholar 

  9. M. Wirsing, Algebraic Specification, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 675–788

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Dortmund, Germany

    Peter Padawitz

Authors
  1. Peter Padawitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michaël Rusinowitch Jean-Luc Rémy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Padawitz, P. (1993). Generic induction proofs. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-56393-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56393-8

  • Online ISBN: 978-3-540-47549-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation