Synthesis of induction orderings for existence proofs

  • Dieter Hutter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 814)


In the field of program synthesis inductive existence proofs are used to compute algorithmic definitions for the skolem functions under consideration. While in general the recursion orderings of the given function definitions form the induction ordering this approach often fail for existence proofs. In many cases a completely new induction ordering has to be invented to prove an existence formula. In this paper we describe a top-down approach for computing appropriate induction orderings for existence formulas. We will use constraints from the knowledge of guiding inductive proofs to select proper induction variables and to compute a first outline of the proof. Based on this outline the induction ordering is finally refined and synthesized.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Biundo et al. 86]
    Biundo et al. The Karlsruhe Induction Theorem Proving System. 8th CADE, LNCS 230, Springer, 1986Google Scholar
  2. [Bi92]
    Biundo, S. Automatische Synthese rekursiver Programme als Beweisverfahren. Springer, IFB302, 1992Google Scholar
  3. [BM79]
    Boyer, R.S. Moore J S. A Computational Logic. Academic Press, 1979Google Scholar
  4. [Bu88]
    Bundy, A. et al. The Use of Explicit Plans to Guide Inductive Proofs. 9th CADE, LNAI 310, Springer-Verlag, 1988Google Scholar
  5. [Bu90]
    Bundy, A. et al. Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs. 10th CADE, LNAI 449, Springer, 1990Google Scholar
  6. [He92]
    Hesketh, J. et al. Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs. 11th CADE, LNAI 607, Springer, 1992Google Scholar
  7. [Hu90]
    Hutter, D. Guiding Induction Proofs. 10th CADE, LNAI 449, Springer, 1990Google Scholar
  8. [Hu91]
    Hutter, D. Mustergesteuerte Strategien für das Beweisen von Gleichheiten. Ph.D. thesis, University of Karlsruhe, 1991Google Scholar
  9. [MW80]
    Manna, Z.; Waldinger, R. A Deductive Approach to Program Synthesis. ACM Transactions on Programming Languages and Systems, Vol. 2 No. 1, 1980Google Scholar
  10. [St88]
    Stevens, A. A Rational Reconstruction of Boyer and Moore's Technique for Constructing Induction Formulas. Proceeding of ECAI88, 1988Google Scholar
  11. [Wa88]
    Walther, C. Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. 9th CADE, LNCS310, Springer, 1988Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Dieter Hutter
    • 1
  1. 1.German Research Center for Artificial IntelligenceDFKISaarbrückenGermany

Personalised recommendations