Induction using term orders

Journal of Automated Reasoning

Volumn 16, Issue 1-2, 1996, Pages 3-37

  Bronsard, Francois ^a,b   Reddy, Uday S ^c   Hasker, Robert W ^c  

^a INRIA   (France)

^b ACCENTURE   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Automated theorem proving; Mutual induction

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATION; COMPUTATIONAL METHODS; INFERENCE ENGINES;

AUTOMATED THEOREM PROVING; LEMMAS; MUTUAL INDUCTION; PROPOSITIONAL ORDERS; TERM ORDERS;

THEOREM PROVING;

EID: 0030100851     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00244458     Document Type: Article

References (38)

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.
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.
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.
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. van Leeuwen (ed.), Handbook of Theoretical Computer Science B: Formal Methods and Semantics, Chapter 6, North-Holland, Amsterdam, 1990, pp. 243-320.
15. Fribourg, L.: A strong restriction of the inductive completion procedure, J. Symbolic Computation, 8(3) (1989), 253-276.
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).
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.
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.
22. Kapur, D. and Musser, D. R.: Proof by consistency, Artificial Intelligence 31(2) (Feb. 1987), 125-157.
23. Kapur, D., Narendran, P., and Zhang, H.: Automating inductionless induction using test sets, J. Symbolic Computation 11 (1991), 83-112.
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.
25. Kounalis, E. and Rusinowitch, M.: Mechanizing inductive reasoning, in Proc. AAAI Conf., AAAI Press and MIT Press, Boston, 1990, pp. 240-245.
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.
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.
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.
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.