<journal article>
NP-HARD ASPECTS IN ANALOGICAL REASONING
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Issue | |
First Page | |
Last Page | |
Publication Type | |
Access Rights | |
Crossref DOI | |
Related DOI | |
Related URI | |
Relation | |
Abstract | 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 dec...iding whether a given atomic formula can be inferred by analogy is NP-hard.show more |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
p155 | 259 KB | 390 |
Details
PISSN | |
---|---|
EISSN | |
NCID | |
Record ID | |
Peer-Reviewed | |
Type | |
Created Date | 2009.04.22 |
Modified Date | 2020.10.22 |