Advertisement

The karlsruhe induction theorem proving system

  • S. Biundo
  • B. Hummel
  • D. Hutter
  • C. Walther
Extended Abstracts Of Current Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1. AUBIN, R. Mechanizing Structural Induction. Part I: Formal System, Part II: Strategies. Theoretical Computer Science 9 (1979).Google Scholar
  2. 2. BIUNDO, S. A Synthesis System Mechanizing Proofs by Induction. Proceedings Seventh ECAI (Brighton 1986).Google Scholar
  3. 3. BOYER, R.S. and MOORE, J S. A Computational Logic. Academic Press (1979).Google Scholar
  4. 4. EISINGER, N. and OHLBACH, H.J. The Markgraph Karl Refutation Procedure (MKRP). Prooceedings Eighth CADE (Oxford 1986), this volume.Google Scholar
  5. 5. HUTTER, D. Using resolution and paramodulation for induction proofs. Interner Bericht 6/86, Universität Karlsruhe, Inst. f. Informatik I (1986).Google Scholar
  6. 6. WALTHER, C. A many-sorted calculus based on resolution and paramodulation. Proceedings Eighth IJCAI (Karlsruhe 1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • S. Biundo
    • 1
  • B. Hummel
    • 1
  • D. Hutter
    • 1
  • C. Walther
    • 1
  1. 1.Institut für Informatik IUniversität KarlsruheKarlsruhe

Personalised recommendations