Scheme-Based Synthesis of Inductive Theories
暂无分享,去创建一个
Alan Bundy | Lucas Dixon | Omar Montano-Rivas | Roy L. McCasland | A. Bundy | R. McCasland | L. Dixon | Omar Montano-Rivas
[1] Tobias Nipkow,et al. Random testing in Isabelle/HOL , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..
[2] Alan Bundy,et al. Rippling - meta-level guidance for mathematical reasoning , 2005, Cambridge tracts in theoretical computer science.
[3] Koji Nakagawa,et al. Theorema: Towards computer-aided mathematical theory exploration , 2006, J. Appl. Log..
[4] Aaron Stump,et al. Slothrop: Knuth-Bendix Completion with a Modern Termination Checker , 2006, RTA.
[5] Bruno Buchberger,et al. Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy , 2004, AISC.
[6] Nachum Dershowitz. Hierachical Termination , 1994, CTRS.
[7] Alexander Krauss,et al. Automating recursive definitions and termination proofs in higher-order logic , 2009 .
[8] Alan Bundy,et al. Conjecture Synthesis for Inductive Theories , 2011, Journal of Automated Reasoning.
[9] Lawrence Charles Paulson,et al. Isabelle's Logics: HOL1 , 2000 .
[10] Douglas B. Lenat,et al. AM, an artificial intelligence approach to discovery in mathematics as heuristic search , 1976 .
[11] Adrian Cr. Decompositions of Natural Numbers: From A Case Study in Mathematical Theory Exploration ∗ , 2008 .
[12] Jacques D. Fleuriot,et al. IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.
[13] Jürgen Giesl,et al. Automatic Termination Proofs in the Dependency Pair Framework , 2006, IJCAR.
[14] Simon Colton,et al. A Grand Challenge of Theorem Discovery , 2003 .
[15] Tobias Nipkow,et al. A Proof Assistant for Higher-Order Logic , 2002 .
[16] MSc PhD Simon Colton BSc. Automated Theory Formation in Pure Mathematics , 2002, Distinguished Dissertations.
[17] Alan Bundy,et al. Ascertaining Mathematical Theorems , 2005, Calculemus.