Theorema: Towards computer-aided mathematical theory exploration

Journal of Applied Logic

Volumn 4, Issue 4, 2006, Pages 470-504

  Buchberger, Bruno ^a   Crǎciun, Adrian ^a   Jebelean, Tudor ^a   Kovács, Laura ^a   Kutsia, Temur ^a   Nakagawa, Koji ^a   Piroi, Florina ^b   Popov, Nikolaj ^a   Robu, Judit ^a   Rosenkranz, Markus ^b   Windsteiger, Wolfgang ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^b JOHANN RADON INSTITUTE FOR COMPUTATIONAL AND APPLIED MATHEMATICS   (Austria)

Author keywords

"Lazy Thinking"; Automated reasoning; Mathematical assistant; Theorema; Theory exploration

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; COMPUTER SOFTWARE; FORMAL LOGIC; THEOREM PROVING;

"LAZY THINKING"; AUTOMATED REASONING; MATHEMATICAL ASSISTANT; THEOREMA; THEORY EXPLORATION;

MATHEMATICAL TECHNIQUES;

EID: 33750069824     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.10.006     Document Type: Article

References (94)

1. Asperti A., Padovani L., Sacerdoti Coen C., Guidi F., and Schena I. Mathematical knowledge management in HELM. Ann. Math. Artificial Intelligence 38 1 (2003) 27-46
2. Bachmair L., Dershowitz N., and Plaisted D. Completion without failure. In: Aït-Kaci H., and Nivat M. (Eds). Resolution of Equations in Algebraic Structures, vol. 2 (1989), Elsevier Science, Amsterdam 1-30
3. Basin D., Deville Y., Flener P., Hamfelt A., and Nilsson J.F. Synthesis of programs in computational logic. In: Bruynooghe M., and Lau K.-K. (Eds). Program Development in Computational Logic. Lecture Notes in Comput. Sci. vol. 3049 (2004), Springer, Berlin 30-65
4. Bertot Y., and Castèran P. Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, An EATCS Series (2004), Springer, Berlin
5. Bledsoe W. Challenge problems in elementary analysis. J. Automat. Reason. 6 (1990) 341-359
6. A. Buch, T. Hillenbrand, Waldmeister: Development of a high preformance completion based theorem prover, SEKI-Report SR-96-01, University of Kaiserslautern, Germany, 1996
7. B. Buchberger, An algorithm for finding the basis elements in the residue class ring modulo a zero dimensional polynomial ideal, PhD thesis, Mathematical Institute, University of Innsbruck, Austria, 1965, in German
8. Buchberger B. Gröbner-bases: An algorithmic method in polynomial ideal theory. In: Bose N.K. (Ed). Multidimensional Systems Theory (1985), Reidel Publishing Company, Dordrecht 184-232
9. Buchberger B. Symbolic computation: Computer algebra and logic. In: Baader F., and Schulz K.U. (Eds). Frontiers of Combining Systems. Applied Logic Series vol. 3 (1996), Kluwer Academic Publishers, Dordrecht 193-219
10. B. Buchberger, Introduction to Gröbner bases, in: [21], pp. 3-31
11. Buchberger B. Theory exploration versus theorem proving. In: Armando A., and Jebelean T. (Eds). Proc. of Calculemus'99. ENTCS vol. 23 (1999), Elsevier, Amsterdam
12. Buchberger B. Theory exploration with Theorema. Analele Universitǎţii din Timişoara, Ser. Matematicǎ-Informaticǎ 38 2 (2000) 9-32
13. B. Buchberger, Algorithm invention and verification by Lazy Thinking, in: [65], pp. 2-26
14. B. Buchberger, Algorithm-supported mathematical theory exploration: A personal view and strategy, in: [16], pp. 236-250
15. Buchberger B. Towards the automated synthesis of a Gröbner bases algorithm. RACSAM (Review of the Spanish Royal Academy of Sciences) 98 1 (2004) 65-75
16. In: Buchberger B., and Campbell J.A. (Eds). Proc. of the 7th Int. Conf. on Artificial Intelligence and Symbolic Computation, AISC'04, Hagenberg, Austria. Lecture Notes in Artif. Intell. vol. 3249 (2004), Springer, Berlin
17. Buchberger B., and Crǎciun A. Algorithm synthesis by Lazy Thinking: Examples and implementation in Theorema. In: Kamareddine F. (Ed). Proc. of the Mathematical Knowledge Management Workshop, Edinburgh. ENTCS vol. 93 (2003), Elsevier, Amsterdam 24-59
18. B. Buchberger, A. Crǎciun, Algorithm synthesis by Lazy Thinking: Using problem schemes, in: [66], pp. 90-106
19. B. Buchberger, C. Dupré, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vǎsaru, W. Windsteiger, The Theorema project: A progress report, in: [44], pp. 98-113
20. Buchberger B., Jebelean T., Kriftner F., Marin M., Tomuţa E., and Vǎsaru D. A survey of the Theorema project. In: Küchlin W. (Ed). Proc. of the Int. Symposium on Symbolic and Algebraic Computation ISSAC'97 (1997), ACM Press, New York 384-391
21. Buchberger B., and Winkler F. Gröbner Bases and Applications (1998), Cambridge University Press, Cambridge, UK Proc. of the Int. Conf. "33 Years of Gröbner Bases", RISC, Austria, London Mathematical Society Lecture Note Series, vol. 251, 1998
22. Caprotti O., and Carlisle D. OpenMath and MathML: Semantic mark up for mathematics. ACM Crossroads 6 2 (1999) special issue on Markup Languages
23. Chou S.C. Mechanical Geometry Theorem Proving (1975), Reidel, Dordrecht, Boston
24. Chou S.C., Gao X.S., and Zhang J.Z. Automated production of traditional proofs in euclidian geometry. Proc. of 8th IEEE Symposium on Logic in Computer Science (1993), IEEE Computer Society Press 48-56
25. Coddington E.A., and Levinson N. Theory of Ordinary Differential Equations (1955), McGraw-Hill Book Company, New York
26. Collins G.E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Second GI Conf. on Authomata Theory and Formal Languages. Lecture Notes in Comput. Sci. vol. 33 (1975), Springer, Berlin 134-183
27. Constable R. Implementing Mathematics Using the Nuprl Proof Development System (1986), Prentice-Hall, Englewood Cliffs, NJ
28. A. Crǎciun, B. Buchberger, Preprocessed Lazy Thinking: Synthesis of sorting algorithms, Technical Report 04-17, RISC, Linz, Austria, 2004
29. J. W. de Bakker, D. Scott, A theory of programs, in: IBM Seminar, Vienna, Austria, 1969
30. de Nivelle H. Bliksem resolution prover. Available to download from (1999). http://www.mpi-sb.mpg.de/~nivelle/software/bliksem/
31. J. Denzinger, S. Schulz, Analysis and representation of equational proofs generated by a distributed completion based proof system, SEKI-Report SR-94-05, University of Kaiserslautern, Germany, 1994
32. Dijkstra E.W. A Discipline of Programming (1976), Prentice-Hall, Englewood Cliffs, NJ
33. B. Elspas, M.W. Green, K.N. Lewitt, R.J. Waldinger, Research in interactive program-proving techniques, Technical Report, Stanford Research Institute, Menlo Park, CA, USA, May 1972
34. Flener P., Lau K.-K., Ornaghi M., and Richardson J.D.C. An abstract formalization of correct schemas for program synthesis. J. Symbolic Comput. 30 1 (2000) 93-127
35. In: Ganzinger H. (Ed). Proc. of the 16th Int. Conf. on Automated Deduction, CADE'99, Trento, Italy. Lecture Notes in Artif. Intell. vol. 1632 (1999), Springer, Berlin
36. Gosper R.W. Decision procedures for indefinite hypergeometric summation. Proc. Nat. Acad. Sci. USA 75 5-6 (1978) 40-42
37. J. Harrison, Metatheory and reflection in theorem proving: A survey and critique, Technical Report CRC-053, SRI Cambridge, UK, 1995
38. K. Hodgson, J. Slaney, Semantic guidance for saturation-based theorem proving, TR-ARP 04-2000, Automated Reasoning Project, Australian National University, Canberra, Australia, 2000
39. Ireland A., and Bundy A. Productive use of failure in inductive proof. J. Automat. Reason. 16 1-2 (1996) 79-111
40. T. Jebelean, Natural proofs in elementary analysis by S-decomposition, Technical Report 01-33, RISC, Linz, Austria, 2001
41. T. Jebelean, L. Kovács, N. Popov, Experimental program verification in Theorema, in: Proc. of the 1st Int. Symposium on Leveraging Applications of Formal Methods, ISOLA'04, 2004
42. Kamke E. Differentialgleichungen und Lösungsmethoden, vol. 1. tenth ed. (1983), Teubner, Stuttgart
43. Kapur D. Using Gröbner bases to reason about geometry problems. J. Symbolic Computation 2 (1986) 399-408
44. M. Kerber, M. Kohlhase (Eds.), Proc. of Calculemus'2000, St. Andrews, UK, 2000
45. M. Kirchner, Program verification with the mathematical software system Theorem, Technical Report 99-16, RISC, Linz, Austria, 1999
46. Kohlhase M. OMDoc: An infrastructure for OpenMath content dictionary information. ACM SIGSAM Bull. 34 2 (2000) 43-48
47. B. Konev, T. Jebelean, Using meta-variables for natural deduction in Theorema, in: [44], pp. 160-175
48. L. Kovács, T. Jebelean, Automated generation of loop invariants by recurrence solving in Theorema, in: [66]
49. Kraan I., Basin D., and Bundy A. Middle-out reasoning for synthesis and induction. J. Automat. Reason. 16 1-2 (1996) 113-145
50. Krall A.M. Applied Analysis (1986), D. Reidel Publishing Company, Dordrecht
51. Kutsia T. Equational prover of Theorema. In: Nieuwenhuis R. (Ed). Proc. of the 14th Int. Conf. on Rewriting Techniques and Applications, RTA'03, Valencia, Spain. Lecture Notes in Comput. Sci. vol. 2706 (2003), Springer, Berlin 367-379
52. T. Kutsia, Solving equations involving sequence variables and sequence functions, in: [16], pp. 157-170
53. Kutsia T., and Buchberger B. Predicate logic with sequence variables and sequence function symbols. In: Asperti A., Bancerek G., and Trybulec A. (Eds). Proc. of the 3rd Int. Conf. on Mathematical Knowledge Management. Lecture Notes in Comput. Sci. vol. 3119 (2004), Springer, Berlin 205-219
54. T. Kutsia, K. Nakagawa, An interface between Theorema and external automated deduction systems, Technical Report 00-29, RISC, Linz, 2000
55. Kutzler B., and Stifter S. On the application of Buchberger's Algorithm to automated geometry theorem proving. J. Symbolic Comput. 2 (1986) 389-397
56. Letz R., Schumann J., Bayerl S., and Bibel W. Setheo: A high-performance theorem prover. J. Automat. Reason. 8 2 (1992) 183-212
57. Loeckx J., and Sieber K. The Foundations of Program Verification. second ed. (1987), Teubner, Stuttgart
58. W. McCune, Otter 3.0 reference manual and guide, ANL-TR 94/6, Argonne National Laboratory, Argonne, USA, 1994
59. McCune W. EQP. Available from (1999). http://www.mcs.anl.gov/AR/eqp/
60. W. McCune, Mace 2.0 user manual and guide, Technical memorandum ANL/MCS-TM 249, Argonne National Laboratory, Argonne, USA, 2001
61. Mellis E., and Siekmann J. Knowledge-based proof planning. Artificial Intelligence 115 1 (1999) 65-105
62. K. Nakagawa, Supporting user-friendliness in the mathematical software system Theorema, PhD thesis, RISC, Johannes Kepler University, Linz, Austria, 2002
63. In: Nashed M.Z. (Ed). Generalized Inverses and Applications, Proc. of an Advanced Seminar Sponsored by the Mathematics Research Center (1976), Academic Press, New York
64. Paule P., and Schorn M. A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities. J. Symbolic Comput. 20 5-6 (1995) 673-698
65. In: Petcu D., Negru V., Zaharie D., and Jebelean T. (Eds). Proc. of SYNASC'03, 5th Int. Workshop on Symbolic and Numeric Algorithms for Scientific Computing, Timişoara, Romania (2003), Mirton
66. In: Petcu D., Negru V., Zaharie D., and Jebelean T. (Eds). Proc. of SYNASC'04, 6th Int. Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timişoara, Romania (2004), Mirton
67. F. Piroi, Tools for using automated provers in mathematical theory exploration, PhD thesis, RISC, Johannes Kepler University, Linz, Austria, August 2004
68. F. Piroi, B. Buchberger, An environment for building mathematical knowledge libraries, in: C. Benzmüller, W. Windsteiger (Eds.), Proc. of the first Workshop on Computer-Supported Mathematical Theory Development, IJCAR'04, Cork, Ireland, 2004, pp. 19-29
69. F. Piroi, B. Buchberger, Label management in mathematical theories, Technical Report 2004-16, RICAM, Linz, Austria, 2004
70. N. Popov, Verification of simple recursive programs: Sufficient conditions, Technical Report 04-06, RISC, Linz, Austria, 2004
71. A. Riazanov, A. Voronkov, Vampire, in: [35], pp. 292-296
72. J. Robu, Systematic exploration of geometric configurations using Theorema based on Mathematica, in: Proc. of 3rd Int. Workshop on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC'01, Timişoara, Romania, 2001, pp. 209-216
73. J. Robu, Automated geometric theorem proving, PhD thesis, RISC, Johannes Kepler University, Linz, Austria, 2002
74. Rodriguez-Carbonell E., and Kapur D. Automatic generation of polynomial loop invariants: Algebraic foundations. Proc. of the Int. Symposium on Symbolic and Algebraic Computation, ISSAC'04, Santander, Spain (2004), ACM Press, New York 266-273
75. M. Rosenkranz, A polynomial approach to linear boundary value problems, PhD thesis, RISC, Johannes Kepler University, Linz, Austria, September 2003
76. M. Rosenkranz, The algorithmization of physics: Math between science and engineering, in: [16], pp. 1-8, invited talk
77. Rosenkranz M. A new symbolic method for solving linear two-point boundary value problems on the level of operators. J. Symbolic Comput. 39 2 (2005) 171-199
78. M. Rosenkranz, B. Buchberger, H.W. Engl, A symbolic algorithm for solving two-point BVPs on the operator, SFB Report 2003-41, Johannes Kepler University, Linz, Austria, 2003
79. Sandhu P. The MathML Handbook (2002), Charles River Media
80. Schulz S. E-a brainiac theorem prover. J. AI Comm. 15 2/3 (2002) 111-126
81. Siekmann J., and Benzmüller C. Omega: Computer supported mathematics. In: Biundo S., Frühwirth T., and Palm G. (Eds). Proc. of the 27th German Conf. on Artificial Intelligence, KI'04, Ulm, Germany. Lecture Notes in Comput. Sci. vol. 3238 (2004), Springer, Berlin 3-28
82. Siekmann J., Hess S., Benzmüller C., Cheikhrouhou L., Fiedler A., Horacek H., Kohlhase M., Konrad K., Meier A., Melis E., Pollet M., and Sorge V. LOUI: Lovely Omega User Interface. Formal Aspects of Computing 11 3 (1999) 326-342
83. Smith D.R. Mechanizing the development of software. In: Broy M., and Steinbrueggen R. (Eds). Calculational System Design, Proc. of the NATO Advanced Study Institute (1999), IOS Press, Amsterdam 251-292
84. Stakgold I. Green's Functions and Boundary Value Problems (1979), John Wiley & Sons, New York
85. Stanley R.P. Differentiably finite power series. European J. Combin. 1 2 (1980) 175-188
86. Sutcliffe G., and Suttner C. The TPTP problem library: CNF Release v1.2.1. J. Automat. Reason. 21 2 (1998) 177-203
87. Tammet T. Gandalf. J. Automat. Reason. 18 2 (1997) 199-204
88. Trybulec A., and Blair H.A. Computer aider reasoning. In: Parikh R. (Ed). Proc. of the Conf. Logic of Programs. Lecture Notes in Comput. Sci. vol. 193 (1985), Springer, Berlin 406-412
89. Warren D.H.D. Higher-order extensions of Prolog: are they needed?. Machine Intelligence vol. 10 (1982), Edinburgh University Press, Edinburgh, UK 441-454
90. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt, D. Topic, System abstract: Spass version 1.0.0. in: [35], pp. 378-382
91. Wiedijk F. Comparing mathematical provers. In: Asperti A., Buchberger B., and Davenport J.H. (Eds). Proc. of the Second Int. Conf. on Mathematical Knowledge Management, Bertinoro, Italy (2003), Springer, Berlin 188-202
92. W. Windsteiger, A set theory prover in Theorema: Implementation and practical applications, PhD thesis, RISC, Johannes Kepler University, Linz, Austria, May 2001
93. Wolfram S. The Mathematica Book. fifth ed. (2003), Wolfram Media Inc.
94. Wu W.T. Basic principles of mechanical theorem proving in elementary geometries. J. Automat. Reason. 2 (1986) 221-252