Scheme-based synthesis of inductive theories

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

Volumn 6437 LNAI, Issue PART 1, 2010, Pages 348-361

  Montano Rivas, Omar ^a   McCasland, Roy ^a   Dixon, Lucas ^a   Bundy, Alan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Mathematical theory exploration; schemes; term rewriting; termination; theorem proving

Indexed keywords

AUTOMATED TOOLS; FORMATION SYSTEMS; HIGHER ORDER LOGIC; INSTANTIATION PROCESS; ISABELLE; KNUTH-BENDIX COMPLETION; MATHEMATICAL THEORY; NATURAL NUMBER; PROOF ASSISTANT; PROOF OBLIGATIONS; PROOF TOOLS; SCHEMES; TERM REWRITING; TERMINATION; INDUCTIVE THEORIES;

PROBLEM SOLVING; FORMAL LOGIC; THEOREM PROVING;

THEOREM PROVING; ARTIFICIAL INTELLIGENCE;

EID: 78650012408     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16761-4_31     Document Type: Conference Paper

References (17)

1. Berghofer, S., Nipkow, T.: Random Testing in Isabelle/HOL. In: SEFM, pp. 230-239 (2004)
2. Buchberger, B.: Algorithm Supported Mathematical Theory Exploration: A Personal View and Stragegy. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 236-250. Springer, Heidelberg (2004)
3. Buchberger, B., Craciun, A., Jebelean, T., Kovács, L., Kutsia, T., Nakagawa, K., Piroi, F., Popov, N., Robu, J., Rosenkranz, M.: Theorema: Towards computer-aided mathematical theory exploration. J. Applied Logic 4(4), 470-504 (2006)
4. Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge Tracts in Theoretical Computer Science, vol. 56. Cambridge University Press, Cambridge (2005)
5. Colton, S.: Automated Theory Formation in Pure Mathematics. PhD thesis, Division of Informatics, University of Edinburgh (2001)
6. Craciun, A., Hodorog, M.: Decompositions of Natural Numbers: From A Case Study in Mathematical Theory Exploration. In: SYNASC 2007 (2007)
7. Dershowitz, N.: Hierachical Termination. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 89-105. Springer, Heidelberg (1995)
8. Dixon, L., Fleuriot, J.D.: IsaPlanner: A Prototype Proof Planner in Isabelle. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 279-283. Springer, Heidelberg (2003)
9. Giesl, J., Schneider-kamp, P., Thiemann, R.: AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281-286. Springer, Heidelberg (2006)
10. Johansson, M., Dixon, L., Bundy, A.: Conjecture Synthesis for Inductive Theories. Journal of Automated Reasoning (2010) (to appear)
11. Krauss, A.: Automating Recursive Definitions and Termination Proofs in Higher-Order Logic. PhD thesis, Dept. of Informatics, T. U. München (2009)
12. Lenat, D.B.: AM: An Artificial Intelligence approach to discovery in Mathematics as Heuristic Search. In: Knowledge-Based Systems in Artificial Intelligence (1982)
13. McCasland, R., Bundy, A., Smith, P.F.: Ascertaining Mathematical Theorems. Electr. Notes Theor. Comput. Sci. 151(1), 21-38 (2006)
14. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle's Logics: HOL (2000)
15. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)
16. Sutcliffe, G., Gao, Y., Colton, S.: A Grand Challenge of Theorem Discovery (June 2003)
17. Wehrman, I., Stump, A., Westbrook, E.: Slothrop: KnuthBendix Completion with a Modern Termination Checker. In: Webster University, St. Louis, Missouri M.Sc. Computer Science, Washington University, pp. 268-279 (2006)