Skip to main content
SpringerLink
Log in

Induction using term orders

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We present a procedure for proving inductive theorems which is based on explicit induction, yet supports mutual induction. Mutual induction allows the postulation of lemmas whose proofs use the theorems ex hypothesi while the theorems themselves use the lemmas. This feature has always been supported by induction procedures based on Knuth-Bendix completion, but these procedures are limited by the use of rewriting (or rewriting-like) inferences. Our procedure avoids this limitation by making explicit the implicit induction realized by these procedures. As a result, arbitrary deduction mechanisms can be used while still allowing mutual induction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bachmair, L.: Proof by consistency in equational theories, in Proc. 3rd LICS Symp., 1988, pp. 228–233.

  2. Bachmair, L., Dershowitz, N., and Plaisted, D. A.: Completion without failure, in H.Aït-Kaci and M.Nivat (eds), Resolutions of Equations in Algebraic Structures, Vol. 2: Rewriting Techniques, Chapter 1, Academic Press, New York, 1989, pp. 1–30.

    Google Scholar 

  3. Biundo, S., Hummel, B., Hutter, D., and Walther, C.: The Karlsruhe induction theorem proving system, in 8th CADE Conf., LNCS 230, Springer-Verlag, 1986.

  4. Bouhoula, A. and Rusinowitch, M.: Automatic case analysis in proof by induction, in R. Bajcsy (ed.), Proc. 13th IJCAI Conf., Vol. 1, Morgan Kaufmann, August 1993, pp. 88–94.

  5. Boyer, R. S. and Moore, J. S.: A Computational Logic, Academic Press, New York, 1979.

    MATH  Google Scholar 

  6. Boyer, R. S. and Moore, J. S.: A theorem prover for a computational logic, in M. E. Stickel (ed.), Proc. 10th CADE Conf., LNCS 449, Springer-Verlag, 1990, pp. 1–15.

  7. Bronsard, F.: Using term ordering to control clausal deductions, PhD thesis, University of Illinois, Urbana, 1995.

  8. Bronsard, F. and Reddy, U. S.: Conditional rewriting in Focus, in S. Kaplan and M. Okada (eds), Proc. 2nd CTRS Workshop, LNCS 516, Springer-Verlag, 1991, pp. 2–13.

  9. Bronsard, F. and Reddy, U. S.: Reduction techniques for first-order reasoning, in M. Rusinowitch and J. L. Rémy (eds), Proc. 3rd CTRS Workshop, LNCS 656, Springer-Verlag, 1992, pp. 242–256.

  10. Bronsard, F., Reddy, U. S., and Hasker, R. W.: Induction using term orderings, in Alan Bundy (ed.), Proc. 12th CADE Conf., LNAI 814, Springer-Verlag, 1994, pp. 102–117.

  11. Bundy, A.: A rational reconstruction and extension of recursion analysis, in IJCAI, 1989.

  12. Dershowitz, N.: Completion and its applications, in Resolution of Equations in Algebraic Structures, Vol. 2: Rewriting Techniques, Academic Press, San Diego, 1989, pp. 31–86.

    Google Scholar 

  13. Dershowitz, N. and Hoot, C.: Natural termination, in C. Kirchner (ed.), Proc. 5th RTA Conf., LNCS 690, Montreal (Canada), Springer-Verlag, 1993, pp. 405–420.

  14. Dershowitz, N. and Jouannaud, J.-P.: Rewrite systems, in J.vanLeeuwen (ed.), Handbook of Theoretical Computer Science B: Formal Methods and Semantics, Chapter 6, North-Holland, Amsterdam, 1990, pp. 243–320.

    Google Scholar 

  15. Fribourg, L.: A strong restriction of the inductive completion procedure, J. Symbolic Computation, 8(3) (1989), 253–276.

    MATH  MathSciNet  Google Scholar 

  16. Goguen, J. A.: How to prove inductive hypotheses without induction, in 5th CADE Conf., LNCS 87, Springer-Verlag, 1980, pp. 356–372.

  17. Gramlich, B.: Induction theorem proving using refined unfailing completion techniques, in ECAI, 1989 (also Technical Report SR-89–14, Universität Kaiserslautern, Germany).

    Google Scholar 

  18. Hofbauer, D. and Kutsche, R. D.: Proving inductive theorems based on term rewriting systems, in J. Grabowski, P. Lescanne, and W. Wechler (eds), Proc. 1st ALP Workshop, Akademie Verlag, 1988, pp. 180–190.

  19. Hsiang, J. and Rusinowitch, M.: On word problems in equational theories, in T. Ottmann (ed.), 14th Intern. Colloq. Automata, Languages and Programming, LNCS 267, Springer-Verlag, July 1987, pp. 54–71.

  20. Huet, G. and Hullot, J.-M.: Proofs by induction in equational theories with constructors, J. of Computer and System Sciences 25 (1982), 239–266.

    Article  MATH  MathSciNet  Google Scholar 

  21. Jouannaud, J.-P. and Kounalis, E.: Automatic proofs by induction in equational theories without constructors, Information and Computation 82 (1989), 1–33. Original version in Symp. LICS, IEEE, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  22. Kapur, D. and Musser, D. R.: Proof by consistency, Artificial Intelligence 31(2) (Feb. 1987), 125–157.

    Article  MATH  MathSciNet  Google Scholar 

  23. Kapur, D., Narendran, P., and Zhang, H.: Automating inductionless induction using test sets, J. Symbolic Computation 11 (1991), 83–112.

    Article  MathSciNet  MATH  Google Scholar 

  24. Knuth, D. and Bendix, P.: Simple word problems in universal algebras, in J.Leech (ed.), Computational Problems in Abstract Algebra, Pergamon, Oxford, 1970, pp. 263–297.

    Google Scholar 

  25. Kounalis, E. and Rusinowitch, M.: Mechanizing inductive reasoning, in Proc. AAAI Conf., AAAI Press and MIT Press, Boston, 1990, pp. 240–245.

    Google Scholar 

  26. Kowalski, R.: Studies in the completeness and efficiency of theorem-proving by resolution, PhD thesis, University of Edinburgh, 1970.

  27. Küchlin, W.: Inductive completion by ground proof transformation, in H.Aït-Kaci and M.Nivat (eds), Resolution of Equations in Algebraic Structures, Vol. 2: Rewriting Techniques, Academic Press, San Diego, 1989, pp. 211–245.

    Google Scholar 

  28. Lankford, D. S.: A simple explanation of inductionless induction, Memo MTP-14, Dept. of Mathematics, Louisiana Tech. Univ., August 1981.

  29. McAllester, D.: Term rewriting induction, theorem-provers@ai.mit.edu electronic bulletin board, 1990.

  30. Musser, D. R.: On proving inductive properties of abstract data types, in ACM Symp. on Princ. of Program. Lang., ACM, 1980, pp. 154–162.

  31. Reddy, U. S.: Term rewriting induction, in M. Stickel (ed.), 10th CADE Conf., LNAI 449, Springer-Verlag, 1990, pp. 162–177.

  32. Rémy, J.-L.: Etude des Systèmes de Réécriture Conditionnels et Applications aux Types Abstraits Algébriques, Th. Etat, INPL, Nancy (France), 1982.

  33. Robinson, G. A. and Wos, L. T.: Paramodulation and first-order theorem proving, in B. Meltzer and D. Mitchie (eds), Machine Intelligence 4, Edinburgh University Press, 1969, pp. 135–150.

  34. Robinson, J. A.: A machine-oriented logic based on the resolution principle, JACM 12 (1965), 12–23.

    Article  Google Scholar 

  35. Rouyer, J. and Lescanne, P.: Verification and programming of first-order unification in the calculus of constructions with inductive types, November 1992.

  36. Selman, A.: Completeness of calculi for axiomatically defined classes of algebras, Algebra Universalis 2 (1972), 20–32.

    Article  MATH  MathSciNet  Google Scholar 

  37. Wirth, C.-P. and Gramlich, B.: On notions of inductive validity for first-order equational clauses, in 12th CADE Conf., LNCS 814, Springer-Verlag, 1994, pp. 162–176.

  38. Zhang, H. and Kapur, D., and Krishnamoorthy, M. S.: A mechanizable induction principle for equational specifications, in E. Lusk and R. Overbeek (eds), 9th CADE Conf., LNCS 310, Springer-Verlag, 1988, pp. 162–181.

Download references

Author information

Author notes

  1. Francois Bronsard

    Present address: Andersen Consulting, 3773 Willow road, #2f5d, 60062-6212, Northbrook, IL, U.S.A.

Authors and Affiliations

  1. CRIN-INRIA-Lorraine, Nancy, France

    Francois Bronsard

  2. The University of Illinois at Urbana-Champaign, U.S.A.

    Uday S. Reddy

  3. The University of Illinois at Urbana-Champaign, U.S.A.

    Robert W. Hasker

Authors
  1. Francois Bronsard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uday S. Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert W. Hasker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A preliminary version of this paper appeared in the proceedings of the 12th Conference on Automated Deduction, A. Bundy, editor.

This author was supported by a grant from the Ministère des Affaires Etrangères, France.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bronsard, F., Reddy, U.S. & Hasker, R.W. Induction using term orders. J Autom Reasoning 16, 3–37 (1996). https://doi.org/10.1007/BF00244458

Download citation

  • Issue Date:

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

Key words

Search

Navigation