A computational logic handbook
A computational logic handbook
Automated reasoning: 33 BASIC research problems
Automated reasoning: 33 BASIC research problems
Tree subsumption: reasoning with outlines
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Flexible strategy learning: analogical replay of problem solving episodes
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Analogy for Automated Reasoning
Analogy for Automated Reasoning
Analogical Reasoning and Proof Discovery
Proceedings of the 9th International Conference on Automated Deduction
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Omega-MKRP: A Proof Development Environment
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Representing and Reformulating Diagonalization Methods
Representing and Reformulating Diagonalization Methods
Analogy as a means of discovery in problem solving and learning
Analogy as a means of discovery in problem solving and learning
A feature-based learning method for theorem proving
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Heine–Borel Challenge Problem. In Honor of Woody Bledsoe
Journal of Automated Reasoning
Analogy in Inductive Theorem Proving
Journal of Automated Reasoning
Semantic Generalizations for Proving and Disproving Conjectures by Analogy
Journal of Automated Reasoning
Towards a Unified Theory of Adaption in Case-Based Reasoning
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
Flexibly Interleaving Processes
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
Generalization in Type Theory Based Proof Assistants
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Octopus: Combining Learning and Parallel Search
Journal of Automated Reasoning
Feature‐based learning of search‐guiding heuristics for theorem proving
AI Communications
| Hi-index | 0.00 |
This paper addresses a model of analogy-driven theorem proving that is more general and cognitively more adequate than previous approaches. The model works at the level of proof-plans. More precisely, we consider analogy as a control strategy in proof planning that employs a source proof-plan to guide the construction of a proof-plan for the target problem. Our approach includes a reformulation of the source proof-plan. This is in accordance with the well known fact that constructing an analogy in maths often amounts to first finding the appropriate representation which brings out the similarity of two problems, i.e., finding the right concepts and the right level of abstraction. Several well known theorems were processed by our analogy-driven proof-plan construction that could not be proven analogically by previous approaches.