Matrix-based inductive theorem proving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1847 LNAI, Issue , 2000, Pages 294-308

  Kreitz, Christoph ^a   Pientka, Brigitte ^b  

^a Center for Applied Mathematics   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDUCTION HYPOTHESIS; INDUCTIVE THEOREM PROVING; INTEGER SQUARE ROOT; PROOF SEARCH;

PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE; COMPUTERS;

THEOREM PROVING;

EID: 84886058940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_24     Document Type: Conference Paper

References (30)

1. A. Armando, A. Smaill & I.Green. Automatic synthesis of recursive programs: The proof-planning paradigm. 12th IEEE International Automated Software Engineering Conference, pp. 2-9, 1997.
2. D. Basin & T.Walsh. A calculus for and termination of rippling. Journal of Automated Reasoning, 16(2):147-180, 1996.
3. J. Bates & R.Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113-136, 1985.
4. W. Bibel. On matrices with connections. Journal of the Association for Computing Machinery, 28:633-645, 1981.
5. W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115-132, 1986.
6. W. Bibel. Automated Theorem Proving. Vieweg, 1987.
7. W. Bibel, D. Korn, C. Kreitz, F.Kurucz, J. Otten, S. Schmitt & G. Stolpmann. A multi-level approach to program synthesis. 7th International Workshop on Logic Program Synthesis and Transformation, LNAI 1463, pp. 1-25, 1998.
8. S. Biundo. Automated synthesis of recursive algorithms as a theorem proving tool. 8th European Conference on Artificial Intelligence, 1988.
9. A. Bundy, F. van Harmelen, A. Smaill et al. Extensions to the rippling-out tactic for guiding inductive proofs. 10th Conference on Automated Deduction, LNCS 449, pp. 132-146, 1990.
10. A. Bundy, A. Stevens, F. van Harmelen et al. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62(2):185-253, 1993.
11. T. Chan. A decision procedure for checking PL/CV arithmetic inferences In Introduction to the PL/CV2 Programming Logic, LNCS 135, pp. 227-264, 1982.
12. R. Constable, S. Allen, M. Bromley, et. al. Implementing Mathematics with the Nu-PRL proof development system. Prentice Hall, 1986.
13. G. Dowek et. al. The Coq proof assistant user's guide. Institut National de Recherche en Informatique et en Automatique, Report RR 134, 1991.
14. J. Hesketh. Using Middle-Out Reasoning to Guide Inductive Theorem Proving. PhD thesis, Dept. of Artificial Intelligence, University of Edinburgh, 1991.
15. D. Hutter. Synthesis of Induction Orderings for Existence Proofs. 12th International Conference on Automated Deduction, LNAI 814, 1994.
16. D. Hutter & C. Sengler. INKA, the next generation. 13th Conference on Automated Deduction, LNAI 1104, pp. 288-292, 1996.
17. I. Kraan, D. Basin & A.Bundy. Logic program synthesis via proof planning. 4th International Workshop on Logic Program Synthesis and Transformation, pp. 1-14, 1993.
18. C. Kreitz, H.Mantel, J. Otten & S. Schmitt. Connection-Based Proof Construction in Linear Logic. 14th Conference on Automated Deduction, LNAI 1249, pp. 207-221, 1997.
19. C. Kreitz, J.Otten & S. Schmitt. Guiding Program Development Systems by a Connection Based Proof Strategy. Fifth International Workshop on Logic Program Synthesis and Transformation, LNCS 1048, pp. 137-151, 1996.
20. C. Kreitz & J.Otten. Connection-based theorem proving in classical and nonclassical logics. Journal of Universal Computer Science, 5(3):88-112, 1999.
21. F. Kurucz. Realisierung verschiedender Induktionsstrategien basierend auf dem Rippling-Kalkül. Diplomarbeit, Technische Universität Darmstadt, 1997.
22. J. Otten & C. Kreitz. A connection based proof method for intuitionistic logic. 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 918, pp. 122-137, 1995.
23. J. Otten & C. Kreitz. T-String-Unification: Unifying Prefixes in Non-Classical Proof Methods. 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071, pp. 244-260, 1996.
24. B. Pientka & C. Kreitz. Automating inductive specification proofs. Fundamenta Informatica, 39(1-2):189-209, 1999.
25. A. Smaill & I .Green. Automating the synthesis of functional programs. Research paper 777, Dept. of Artificial Intelligence, University of Edinburgh, 1995.
26. S. Schmitt & C. Kreitz. On transforming intuitionistic matrix proofs into standardsequent proofs. 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 918, pp. 106-121, 1995.
27. S. Schmitt & C. Kreitz. Converting non-classical matrix proofs into sequent-style systems. 13th Conference on Automated Deduction, LNAI 1104, pp. 418-432, 1996.
28. T. Tammet. A resolution theorem prover for intuitionistic logic. 13th Conference on Automated Deduction, LNAI 1104, pp. 2-16, Springer, 1996.
29. L.Wallen. Automated deduction in nonclassical logic. MIT Press, 1990.
30. C.Weidenbach. SPASS: Combining superposition, sorts and splitting. Handbook of Automated Reasoning. Elsevier, 1999.