Internal analogy in theorem proving

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

Volumn 1104, Issue , 1996, Pages 92-105

  Melis, Erica ^a   Whittle, Jon ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; PROBLEM SOLVING;

AUTOMATED THEOREM PROVING; CONTROL STRATEGIES; PROBLEM SOLVING PROCESS; PROOF PLANS; REPEATED APPLICATION; SUB-PROBLEMS;

THEOREM PROVING;

EID: 84957718440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61511-3_71     Document Type: Conference Paper

References (11)

1. [Bundy et al 91] A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303-324, 1991.
2. [Bundy et al 93] A. Bundy, Stevens A, F. Van Harmelen, A. Ireland, and A. Smaill. A heuristic for guiding inductive proofs. Artificial Intelligence, 63:185-253, 1993.
3. [Caxbonell 86] J.G. Carbonell. Derivational analogy: A theory of reconstructive problem solving and expertise acquisition. In R.S. Michalsky, J.G. Carbonell, and T.M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, pages 371-392. Morgan Kaufmann Publ, Los Altos, 1986.
4. [Gordon et al 79] M. Gordon, R. Milner, and C.P. Wadsworth. Edinburgh LCF: A Mechanized Logic of Computation. Lecture Notes in Computer Science 78. Springer, Berlin, 1979.
5. [Hickman & Larkin 90] Angela K. Hickman and Jill H. Larkin. Internal analogy: A model of transfer within problems. In The 12th Annual Conference of The Cognitive Science Society, pages 53-60, Hillsdale, NJ, 1990. Lawrence Erlbaum Associates.
6. [Kennedy 95] Angela K. Kennedy. Internal Analogy: A First Step Towards a Unified Theory of Analogical Problem Solving. Unpublished PhD thesis, Carnegie Mellon University, to appear 1995.
7. [Hutter 90] D. Hutter. Guiding inductive proofs. In M.E. Stickel, editor, Proc. of 10th International Conference on Automated Deduction (CADE), volume Lecture Notes in Artificial Intelligence 449. Springer, 1990.
8. [Ireland & Bundy 94] A. Ireland and A. Bundy. Productive use of failure in inductive proof. Technical report, Department of Al Edinburgh, 1994. Available from Edinburgh as DAI Research Paper 716.
9. [Kolbe & Walther 95] Th. Kolbe and Ch. Walther. Second-order matching modulo evaluation - a technique for reusing proofs. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 1995. Morgan Kaufmann.
10. [Owen 90] S. Owen. Analogy for automated reasoning. Academic Press, London, 1990.
11. [Reif & Stenzel 93] W. Reif and K. Stenzel. Reuse of Proofs in Software Verification. In Proc. 13th Conference on Foundations of Software Technology and Theoretical Computer Science, 1993. pages 74- 85. LNCS 761, Springer.