Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy

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

Volumn 3249, Issue , 2004, Pages 236-250

  Buchberger, Bruno ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PATENTS AND INVENTIONS;

BOTTOM UP; MATHEMATICAL SOFTWARE; MATHEMATICAL THEORY; META PROGRAMMING; REASONERS; TOPDOWN;

COMPUTATION THEORY;

EID: 35048878850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_20     Document Type: Article

References (26)

1. An Interactive Mathematical Proof System, http://imps.mcmaster.ca/.
2. The COQ Proof Assistant, http://coq.inria.fr/.
3. The MIZAR Project, http://www.mizar.org/.
4. The OMEGA System, http://www.ags.uni-sb.de/omega/.
5. A. Asperti, B. Buchberger, and J. H. Davenport, editors. Mathematical Knowledge Management: Second International Conference, MKM 2003 Bertinoro, Italy, February 16-18, 2003, volume 2594 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
6. B. Buchberger. Groebner Rings in THEOREMA: A Case Study in Functors and Categories. Technical Report 2003-46, SFB (Special Research Area) Scientific Computing, Johannes Kepler University, Linz, Austria, 2003.
7. B. Buchberger. Towards the automated synthesis of a Gröbner bases algorithm. RACSA M (Review of the Spanish Royal Academy of Sciences), 2004. To appear.
8. B. Buchberger and A. Craciun. Algorithm synthesis by lazy thinking: Examples and implementation in THEOREMA. In Proc. of the Mathematical Knowledge Man-agement Symposium, volume 93 of ENTCS, pages 24-59, Edunburgh, UK, 25-29 November 2003. Elsevier Science.
9. B. Buchberger, C. Dupré, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, and W. Windsteiger. The THEOREMA project: A progress report. In M. Kerber and M. Kohlhase, editors, Proc. of Calculemus'2000 Conference, pages 98-113, St. Andrews, UK, 6-7 August 2000.
10. B. Buchberger, G. Gönnet, and M. Hazewinkel, editors. Mathematical Knowledge Management: Special Issue of Annals of Mathematics and Artificial Intelligence, volume 38. Kluwer Academic Publisher, 2003.
11. R. Constable. Implementing Mathematics Using the NUPRL Proof Development System. Prentice-Hall, 1986.
12. N. G. de Bruijn. The mathematical language AUTOMATH, its usage, and some of its extensions. In M. Laudet, D. Lacombe, L. Nolin, and M. Schützenberger, editors, Proc. of Symposium on Automatic Demonstration, Versailles, France, volume 125 of LN in Mathematics, pages 29-61. Springer Verlag, Berlin, 1970.
13. M. Gordon and T. Melham. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, 1993.
14. R. Harper. Programming in Standard ML. Carnegie Mellon University, www2.cs.cmu.edu/~rwh/smlbook/online.pdf, 2001.
15. M. Kohlhase. OMDoc: Towards an internet standard for the administration, distribution and teaching of mathematical knowledge. In J. A. Campbell and E. RoanesLozano, editors, Artificial Intelligence and Symbolic Computation: Proc. of the International Conference AISC'SOOO, volume 1930 of Lecture Notes in Computer Science, pages 32-52, Madrid, Spain, 2001. Springer Verlag.
16. T. Kutsia and B. Buchberger. Predicate logic with sequence variables and sequence function symbols. In A. Asperti, G. Bancerek, and A. Trybulec, editors, Proc. of the 3rd Int. Conference on Mathematical Knowledge Management, MKM'04, volume 3119 of Lecture. Notes in Computer Science, Bialowieza, Poland, 19-21 September 2004. Springer Verlag. To appear.
17. Zh. Luo and R. Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, 1992.
18. L. Magnusson and B. Nordström. The ALF proof editor and its proof engine. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs, volume 806 of LNCS, pages 213-237. Springer Verlag, 1994.
19. K. Nakagawa. Supporting user-friendliness in the mathematical software system THEOREMA. Technical Report 02-01, PhD Thesis. RISC/Johannes Kepler University, Linz, Austria, 2002.
20. L. Paulson. ISABELLE: the next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science, pages 361-386. Academic Press, 1990.
21. F. Pfenning. ELF: A meta-languagc for deductive systems. In A. Bundy, editor, Proc. of the 12th International Conference on Automated Deduction, CADE'94, volume 814 of LNAI, pages 811-815, Nancy, France, 1995. Springer Verlag.
22. F. Pfenning. Logical frameworks. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, chapter 17, pages 1063-1147. Elsevier Science and MIT Press, 2001.
23. F. Piroi and B. Buchberger. An environment for building mathematical knowledge libraries. In A. Asperti, G. Bancerek, and A. Trybulec, editors, Proc. of the 3rd Int. Conference on Mathematical Knowledge Management, MKM'04, volume 3119 of Lecture Notes in Computer Science, Bialowieza, Poland, 19-21 September 2004. Springer Verlag. To appear.
24. E. Tomuta. An architecture for combining provers and its applications in the THEOREMA system. Technical Report 98-14, PhD Thesis. RISC, Johannes Kepler University, Linz, Austria, 1998.
25. M. Sato. Theory of judgments and derivations. In Arikawa, S. and Shinohara, A. eds., Progress in Discovery Science, Lecture Notes in Artificial Intelligence 2281, pp. 78 - 122, Springer, 2002.
26. M. Sato, T. Sakurai, Y. Kameyama and A. Igarashi. Calculi of meta-variables. In Baaz M. and Makowsky, J.A. eds., Computer Science Logic, Lecture Notes in Computer Science 2803, pp. 484 - 497, Springer, 2003.