NP-HARD ASPECTS IN ANALOGICAL REASONING
Shinji Furuya, Satoru Miyano · Bulletin of informatics and cybernetics · 1993
Analogy is described in terms of predicate logic. This paper considers the complexity of analogical reasoning in which no function symbols except constants are allowed. We show that the problem of deciding whether a given atomic formula can be inferred by analogy is NP-hard.