Open AccessNP-HARD ASPECTS IN ANALOGICAL REASONING
Author(s) -
Shinji Furuya,
Satoru Miyano
Publication year - 1993
Publication title -
bulletin of informatics and cybernetics
Language(s) - English
Resource type - Journals
eISSN - 2435-743X
pISSN - 0286-522X
DOI - 10.5109/13428
Subject(s) - analogical reasoning , computer science , epistemology , analogy , philosophy
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom