Building proofs or counterexamples by analogy in a resolution framework

  • Christophe Bourely
  • Gilles Défourneaux
  • Nicolas Peltier
Automated Reasoning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1126)


Taking an extension of resolution as a base calculus (though its principles are applicable to other calculi) for searching proofs (refutations) and counterexamples (models), we introduce a new method able to find refutations and also models by analogy with refutations and models in a knowledge base. The source objects for the analogy process are generalizations of the refutations (models). They are included in the knowledge base, and then unification techniques for the choice of the relevant source objects as well as the building of a new proof or a model by analogy are used. These steps are rather standard, and can hardly be avoided. Our method follows these steps but incorporates original contributions on each of them. A method to build new proofs as well as models by analogy with existing ones is proposed. Some comparisons with existing methods as well as two detailed running examples on generalization show evidence of the interest of our approach.


generalization analogy extended resolution model building second order terms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BCP94]
    Christophe Bourely, Ricardo Caferra, and Nicolas Peltier. A method for building models automatically. Experiments with an extension of OTTER. In Proc. of CADE-12, pages 72–86. Springer Verlag, 1994. LNAI 814.Google Scholar
  2. [BdlTC87]
    Th. Boy de la Tour and R. Caferra. Proof analogy in interactive theorem proving: A method to express and use it via second order pattern matching. In Proceedings of AAAI 87, pages 95–99. Morgan Kaufmann, 1987.Google Scholar
  3. [BdlTK92]
    Th. Boy de la Tour and Ch. Kreitz. Building proofs by analogy via the Curry-Howard isomorphism. In Proceedings of LPAR 92, pages 202–213. Springer Verlag, 1992.Google Scholar
  4. [Ble77]
    W. W. Bledsoe. Non-resolution theorem proving. Artificial Intelligence, 9:1–35, 1977.CrossRefGoogle Scholar
  5. [CL89]
    Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371–475, 1989.Google Scholar
  6. [CP95a]
    Ricardo Caferra and Nicolas Peltier. Extending semantic resolution via automated model building: applications. In Proceeding of IJCAI'95, pages 328–334. Morgan Kaufman, 1995.Google Scholar
  7. [CP95b]
    Ricardo Caferra and Nicolas Peltier. Model building and interactive theory discovery. In Proceeding of Tableaux'95, LNAI 918, pages 154–168. Springer-Verlag, 1995.Google Scholar
  8. [CQS96]
    R. Curien, Z. Qian, and Hui Shi. Efficient second-order matching. In Proceedings of 7th Rewriting Techniques and Applications, 1996. To appear.Google Scholar
  9. [CZ92]
    Ricardo Caferra and Nicolas Zabel. A method for simultaneous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13:613–641, 1992.Google Scholar
  10. [Hal89]
    R.P. Hall. Computational approaches to analogical reasoning: A comparative analysis. Artificial Intelligence, pages 39–120, 1989.Google Scholar
  11. [Kli71]
    R.E. Kling. A paradigm for reasoning by analogy. Artificial Intelligence, 2, 1971.Google Scholar
  12. [KW95]
    Th. Kolbe and Ch. Walther. Second-order pattern matching modulo evaluation — A technique for reusing proofs. In Chris S. Mellish, editor, Proceedings of IJGAI 95, pages 190–195. IJCAI, Morgan Kaufmann, 1995.Google Scholar
  13. [Lov78]
    Donald W. Loveland. Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North Holland, 1978.Google Scholar
  14. [Mel95]
    E. Melis. A model of analogy-driven proof-plan construction. In C. S. Mellish, editor, Proceedings of IJCAI'95, pages 182–188. IJCAI, Morgan Kaufmann Publishers Inc., 1995.Google Scholar
  15. [Mun81]
    J.C. Munyer. Analogy as a mean of discovery in problem-solving and learning. PhD thesis, Univ. Calif. Santa Cruz, 1981.Google Scholar
  16. [Pla81]
    D.A. Plaisted. Theorem proving with abstraction. Artificial Intelligence, 16:47–108, 1981.CrossRefGoogle Scholar
  17. [SS95]
    Ch. B. Suttner and G. Sutcliffe. The TPTP problem library. Technical report, TU München / James Cook University, 1995. V-1.2.0.Google Scholar
  18. [WOLB92]
    Larry Wos, Ross Overbeek, Ewin Lush, and Jim Boyle. Automated Reasoning: Introduction and Application. McGraw-Hill, second edition, 1992.Google Scholar
  19. [Wos88]
    Larry Wos. Automated Reasoning, 33 Basic Research Problems. Prentice Hall, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Christophe Bourely
    • 1
  • Gilles Défourneaux
    • 1
  • Nicolas Peltier
    • 1
  1. 1.LEIBNIZ-IMAGGrenoble CedexFrance

Personalised recommendations