Scheme-based systematic exploration of natural numbers

Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2006

Volumn , Issue , 2006, Pages 23-31

  Hodorog, Mǎdǎlina ^a   Crǎciun, Adrian ^a  

^a Institute e Austria   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

PATENTS AND INVENTIONS;

EXPLORATION MODEL; KNOWLEDGE SCHEMES; NATURAL NUMBER; REASONING RULES; SYSTEMATIC EXPLORATION;

COMPUTATION THEORY;

EID: 46449138738     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SYNASC.2006.67     Document Type: Conference Paper

References (20)

1. A. Asperti, G. Bancerek, and A. Trybulec, editors. Mathematical Knowledge Management: Third International Conference MKM 2004 Bialowieza, Poland, September 19-21, 2004, volume 3119 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2004.
2. A. Asperti, B. Buchberger, and J. 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 Berlin / Heidelberg, 2003.
3. B. Buchberger. Algorithm-supported mathematical theory exploration: A personal view and strategy. Lecture Notes in Artificial Intelligence, Springer, 7th Conference on Artificial Intelligence and Symbolic Computation(Research Institute for Symbolic Computation, Hagenberg, Austria) (Proceedings of AISC 2004): 16, September.
4. B. Buchberger. Logic for computer science, lecture notes, 1991.
5. B. Buchberger. Algorithm invention and verification by lazy thinking. In D. Petcu, V. Negru, D. Zaharie, and T. Jebelean, editors, Proceedings of SYNASC 2003, 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing Timisoara, pages 2-26, Timisoara, Romania, 1-4 October 2003. Copyright: Mirton Publisher.
6. B. Buchberger. Towards the automated synthesis of a groebner bases algorithm. RACSAM - Revista de la Real Academia de Ciencias (Review of the Spanish Royal Academy of Science), Serie A: Mathematicas, 98(1):65-75, 2004.
7. B. Buchberger and O. Caprotti, editors. First International Workshop on Mathematical Knowledge Management (MKM 2001), September 2001.
8. B. Buchberger and A. Craciun. Algorithm synthesis by lazy thinking: Using problem schemes. In D.Petcu, V.Negru, D.Zaharie, and T.Jebelean, editors, Proceedings of SYNASC 2004, 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Timisoara, pages 90-106, Timisoara, Romania, 26-30 September 2004. Copyright: Mirton Publisher.
9. B. Buchberger, A. Craciun, T. Jebelean, L. Kovacs, T. Kutsia, K. Nakagawa, F. Piroi, N. Popov, J. Robu, M. Rosenkranz, and W. Windsteiger. Theorema: Towards computer-aided mathematical theory exploration. Journal of Applied Logic, pages -, 2005. To appear.
10. B. Buchberger and A. Crǎciun. Algorithm synthesis by lazy thinking: Examples and implementation in theorema. In F. Kamareddine, editor, Electronic Notes in Theoretical Computer Science, volume 93, pages 24-59, 18 February 2004. Proc. of the Mathematical Knowledge Management Workshop, Edinburgh, Nov. 25, 2003.
11. B. Buchberger, C. Dupre, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, and W.Windsteiger. Theorema: A progress report. Technical Report 99-42, RISC Report Series, University of Linz, Austria, December 1999. Also available as SFB Report 99-35, Johannes Kepler University Linz, Spezialforschungsbereich F013, December, 1999.
12. B. Buchberger, T. Jebelean, F. Kriftner, M. Marin, E. Tomuta, and D. Vasaru. A survey of the theorema project. Technical Report 97-15, RISC Report Series, University of Linz, Austria, March 1997.
13. S. Colton. Automated Theory Formation in Pure Mathematics. Distinguished Dissertations. Springer Verlag, 2002.
14. S. Colton, A. Bundy, and T. Walsh. On the notion of interestingness in automated mathematical discovery. IJHCS: International Journal of Human-Computer Studies, 53, 2000.
15. A. Crǎciun. The Lazy Thinking Approach to Algorithm Synthesis: Implementation and Case Studies in Theorema. PhD thesis, Research Instiute for Symbolic Computation, Johannes Kepler University, Linz, 2006, forthcoming.
16. A. Crǎciun and M. Hodorog. The quotient-remainder theorem for naturals: Discovery by lazy thinking. Technical Report no.09-06, I-eAT, 2006.
17. M. Hodorog. Scheme-based systematic exploration of mathematical theories, case study: The natural numbers. Technical Report no.07-06, I-eAT, 2006.
18. Z. Manna and R. Waldinger. The Logical Basis for Computer Programming, Volume I, Deductive Reasoning. Addison-Wesley Publishing Co, SUA, 1985.
19. R. McCasland, A. Bundy, and P. Smith. Ascertaining mathematical theorems. Electronic Notes in Theoretical Computer Science, 151(1), 2006.
20. J. R. Shoenfield. Mathematical Logic. Addison-Wesley Publishing Co, SUA, 1967.