Export

Link to this page

Please use this URL for citations.

Search Other Services

Statistics

  • Access to this page：1,731 times

＜journal article＞
NP-HARD ASPECTS IN ANALOGICAL REASONING

Creator
Creator Name
Furuya, Shinji
古屋 晋二
Affiliation
Affiliation Name
Department of Information Systems, Interｄisciplinary Graduate School of Engineering Science, Kyushu University→Matsushita Electric Co., Ltd
九州大学大学院総合理工学研究科情報システム学専攻→松下電器産業株式会社
Author PID
L001145
Creator Name
Miyano, Satoru
宮野, 悟
Affiliation
Affiliation Name
Department of Information Systems, Interｄisciplinary Graduate School of Engineering Science, Kyushu University→Matsushita Electric Co., Ltd
九州大学大学院総合理工学研究科情報システム学専攻→松下電器産業株式会社
Language
English
Publisher
Research Association of Statistical Sciences
統計科学研究会
Date
1993-03
Source Title
Bulletin of informatics and cybernetics
Vol
25
Issue
3/4
First Page
155
Last Page
159
Publication Type
Version of Record
Access Rights
open access
Crossref DOI
https://doi.org/10.5109/13428
Related DOI
Bulletin of informatics and cybernetics || 25(3/4) || p155-159
http://bic.math.kyushu-u.ac.jp/
Related URI
Bulletin of informatics and cybernetics || 25(3/4) || p155-159
http://bic.math.kyushu-u.ac.jp/
Relation
Bulletin of informatics and cybernetics || 25(3/4) || p155-159
http://bic.math.kyushu-u.ac.jp/
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.

pdf p155 pdf 259 KB 378  

Details

PISSN
0286-522X
EISSN
2435-743X
NCID
AA10634475
Record ID
13428
Peer-Reviewed
Refereed
Type
学術雑誌論文
Created Date 2009.04.22
Modified Date 2020.10.22

People who viewed this item also viewed