Computational approaches to analogical reasoning: a comparative analysis
Artificial Intelligence
Equational problems anddisunification
Journal of Symbolic Computation
Artificial Intelligence - Special volume on natural language processing
Positive and negative results for higher-order disunification
Journal of Symbolic Computation
Building Proofs or Counterexamples by Analogy in a Resoluton Framework
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Method for Building Models Automatically. Experiments with an Extension of OTTER
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Partial Matching for Analogy Discovery in Proofs and Counter-Examples
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Second-order matching modulo evaluation: a technique for reusing proofs
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
| Hi-index | 0.00 |
A method is presented for analogical reasoning in Automated Deduction. We focus on the abductive aspects of analogy and give a unified treatment for theorems and non-theorems. Abduction allows to deal with partial analogies thus strongly increasing the application field of the method. It also allows to detect "bad analogies" in several cases. Explanatory examples as well as more realistic examples quantifying the effects of using analogy (for theorem-proving and for counter-example building) are given.