Scheme-based theorem discovery and concept invention

Expert Systems with Applications

Volumn 39, Issue 2, 2012, Pages 1637-1646

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

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Completion; Isabelle HOL; Theorem proving; Theory exploration

Indexed keywords

AUTOMATED TOOLS; HIGHER ORDER LOGIC; INSTANTIATION PROCESS; ISABELLE; ISABELLE/HOL; KNUTH-BENDIX COMPLETION; MATHEMATICAL THEORY; NATURAL NUMBER; PROOF ASSISTANT; PROOF OBLIGATIONS; PROOF TOOLS; THEORY-EXPLORATION;

MATHEMATICAL OPERATORS;

THEOREM PROVING;

EID: 80054943783     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.06.055     Document Type: Conference Paper

References (25)

1. F. Baader, and T. Nipkow Term rewriting and all that 1998 Cambridge University Press
2. Berghofer, S.; & Nipkow, T. (2004). Random testing in Isabelle/HOL. In SEFM (pp. 230-239). (Pubitemid 40456425)
3. Blanchette, J. C.; & Nipkow, T. (2009). Nitpick: A counterexample generator for higher-order logic based on a relational model finder. Technical report, In TAP 2009: Short papers, ETH.
4. Buchberger. B. (2004). Algorithm supported mathematical theory exploration: A personal view and stragegy. In B. Buchberger & J. Campbell (Eds.), Proceedings of AISC 2004 (7th international conference on artificial intelligence and symbolic computation) (Vol. 3249, pp. 236-250), Lecture Notes in Artificial Intelligence. Austria: Springer, Berlin-Heidelberg, RISC, Johannes Kepler University.
5. B. Buchberger, A. Craciun, T. Jebelean, L. Kovács, T. Kutsia, and K. Nakagawa Theorema: Towards computer-aided mathematical theory exploration Journal of Applied Logic 4 4 2006 470 504 (Pubitemid 44647981)
6. A. Bundy The automation of proof by mathematical induction A. Robinson, A. Voronkov, Handbook of automated reasoning Vol. 1 2001 Elsevier 845 911
7. A. Bundy, D. Basin, D. Hutter, and A. Ireland Rippling: Meta-level guidance for mathematical reasoning Cambridge tracts in theoretical computer science Vol. 56 2005 Cambridge University Press
8. Colton, S. (2001). Automated theory formation in pure mathematics. PhD thesis, Division of Informatics, University of Edinburgh.
9. Craciun, A. (2008). Lazy Thinking algorithm synthesis in Gröbner bases theory. PhD thesis, Research Institute for Symbolic Computation (RISC).
10. Craciun, A.; & Hodorog, M. (2007). Decompositions of natural numbers: From a case study in mathematical theory exploration. Symbolic and numeric algorithms for scientific computing. In International symposium on symbolic and numeric algorithms for scientific computing (pp. 41-47).
11. N. Dershowitz Hierarchical termination CTRS '94: Proceedings of the 4th international workshop on conditional and typed rewriting systems 1995 Springer London, UK 89 105
12. Dixon, L.; & Fleuriot, J. D. (2003). IsaPlanner: A prototype proof planner in Isabelle. In Proceedings of CADE'03, LNCS (Vol. 2741, pp. 279-283). (Pubitemid 36940715)
13. J. Giesl, P. Schneider-kamp, and R. Thiemann AProVE 1.2: Automatic termination proofs in the dependency pair framework Proceedings of the 3rd international joint conference on automated reasoning (IJCAR'06) 2006 Springer-Verlag 281 286 (Pubitemid 44532680)
14. Johansson, M. (2009). Automated discovery of inductive lemmas. PhD thesis, School of Informatics, University of Edinburgh.
15. Johansson, M.; Dixon, L.; & Bundy, A. (in press). Conjecture synthesis for inductive theories. Journal of Automated Reasoning, 1-39. doi:10.1007/s10817-010-9193-y.
16. Krauss, A. (2009). Automating recursive definitions and termination proofs in higher-order logic. PhD thesis, Dept. of Informatics, T.U. München.
17. D.B. Lenat Automated theory formation in mathematics IJCAI'77: Proceedings of the 5th international joint conference on artificial intelligence 1977 Morgan Kaufman 833 842
18. Lenat, D.B. (1982). AM: An artificial intelligence approach to discovery in mathematics as heuristic search. In Knowledge-based systems in artificial intelligence (pp. 833-842). McGraw-Hill. Also available from Stanford as TechReport AIM 286.
19. U. Martin, and T. Nipkow Ordered rewriting and confluence Proceedings of the tenth international conference on automated deduction CADE-10 1990 Springer-Verlag New York, Inc. New York, NY, USA 366 380
20. R. McCasland, A. Bundy, and P.F. Smith Ascertaining mathematical theorems Electronics Notes in Theoretical Computer Science 151 1 2006 21 38
21. Montano-Rivas, O.; McCasland, R.; Dixon, L.; & Bundy, A. (2010). Scheme-based synthesis of inductive theories. In MICAI, LNCS (Vol. 6437, pp. 348-361).
22. Nipkow, T.; Paulson, L. C.; & Wenzel, M. (2000). Isabelle's Logics: HOL.
23. T. Nipkow, L.C. Paulson, and M. Wenzel Isabelle/HOL - A proof assistant for higher-order logic LNCS Vol. 2283 2002 Springer
24. Sutcliffe, G.; Gao, Y.; & Colton, S. (2003). A grand challenge of theorem discovery.
25. Wehrman, I.; Stump, A.; & Westbrook, E. (2006). Slothrop: KnuthBendix completion with a modern termination checker. In Webster University, St. Louis, Missouri, M.Sc. Computer Science, Washington University (pp. 268-279).