Reasoning by analogy as a partial identity between models

  • Makoto Haraguchi
  • Setsuo Arikawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 265)


We present in this paper a formal theory of analogical reasoning. We are mainly concerned with three subjects: a formal definition of analogy, a formalization of the reasoning in terms of deduction, and a method for realizing the reasoning in a logic programming system. First we assume that each domain for the reasoning is the least model for logic program. Then we consider an analogy as a partial identity between the models. Secondly we introduce a notion of rule transformation which transforms rules in one domain into those in the other. Then we can formalize the reasoning as a system with three inference rules: instantiation of rules, modus ponens, and the rule transformation. Finally, based on the formalization, we present an extended pure-Prolog interpreter which performs the detection of analogy and the reasoning by the partial identity at the same time.


Logic Program Logic Programming Rule Transformation Predicate Symbol Modus Ponens 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Apt, K.R. and van Emden, M.H. (1982): Contribution to the theory of logic programming, JACM, 29, 3, 841–862.Google Scholar
  2. [2]
    Clark, K.L. (1978): Negation as Failure, in Logic and Databases, H. Gallaire and J. Minker (Eds.), Plenum Press, New York, 293–322.Google Scholar
  3. [3]
    Gentner, P. (1982): Are scientific analogies metaphors?, in Metaphor: Problems and Perspectives, D.S. Miall (Ed.), The Harvester Press, Sussex, 106–132.Google Scholar
  4. [4]
    Haraguchi, M. (1985): Towards a mathematical theory of analogy, Bull. Inform. Cybernetics, 21, 29–56.Google Scholar
  5. [5]
    Haraguchi, M. (1986): Analogical reasoning using transformations of rules, LNCS 221, 56–65.Google Scholar
  6. [6]
    Haraguchi, M. and Arikawa, S. (1986): A formulation and a realization of analogical reasoning, Journal of JSAI, 1, 1, 132–139 (in Japanese).Google Scholar
  7. [7]
    Haraguchi, M. and Arikawa, S. (1986): Analogical Union of Logic Programs, Proc. Logic Programming Conference '86, 103–110.Google Scholar
  8. [8]
    Lloyd, J.W. (1984): Foundations of logic programming, Springer-Verlag.Google Scholar
  9. [9]
    Polya, G. (1954): Induction and analogy in mathematics, Princeton University Press.Google Scholar
  10. [10]
    Winston, P.H. (1980): Learning and reasoning by analogy, CACM, 23, 689–703.Google Scholar
  11. [11]
    Winston, P.H. (1983): Learning new principles from precedents and exercises, Artificial Intelligence, 19, 321–350.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Makoto Haraguchi
    • 1
  • Setsuo Arikawa
    • 1
  1. 1.Research Institute of Fundamental Information ScienceKyushu University 33FukuokaJapan

Personalised recommendations