Knowledge Table : An Approach to Speeding up the Search for Relational Information in Knowledge Base

• Item type: JInfP(1)
• 公開日: 1991-02-10
• タイトル: Knowledge Table : An Approach to Speeding up the Search for Relational Information in Knowledge Base
• タイトル / 言語: en
• タイトル: Knowledge Table : An Approach to Speeding up the Search for Relational Information in Knowledge Base
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: International Institute for Advanced Study of Social Information Science FUJITSU LIMlTED.
• 著者所属(英): en
• 著者所属(英): International Institute for Advanced Study of Social Information Science, FUJITSU LIMlTED.
• 著者名: Toramatsu, Shintani
• 著者名(英): Toramatsu, Shintani
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: For efficient knowledge utilization it is necessary to keep relationships between knowledge such as isa (or class-inclusion) relationships hasa (or part-whole) relationships and data dependencies. These relationships are useful for managing and manipulating knowledge to solve complex problems in connection with belief revision default reasoning multiple inheritance within networks and so on. Unfortunately keeping and using them can be ineffective and expensive when large numbers of relationships are involved. In this paper a knowledge table is introduced as a structure that allows effective searching for relationships in knowledge bases. The knowledge table is a table-like representation for keeping relationships that precludes the need for depth-first searching. To create the table we use logical bitwise computations for searching and for representing relationships. This greatly speeds up the search for the relationships and makes it easy to find loop structures among the relationships.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: For efficient knowledge utilization, it is necessary to keep relationships between knowledge such as isa (or class-inclusion) relationships, hasa (or part-whole) relationships, and data dependencies. These relationships are useful for managing and manipulating knowledge to solve complex problems in connection with belief revision, default reasoning, multiple inheritance within networks, and so on. Unfortunately, keeping and using them can be ineffective and expensive when large numbers of relationships are involved. In this paper, a knowledge table is introduced as a structure that allows effective searching for relationships in knowledge bases. The knowledge table is a table-like representation for keeping relationships that precludes the need for depth-first searching. To create the table, we use logical bitwise computations for searching and for representing relationships. This greatly speeds up the search for the relationships and makes it easy to find loop structures among the relationships.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA00700121
• 書誌情報: Journal of Information Processing; 巻 13, 号 4, p. 494-505, 発行日 1991-02-10
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-6652
• 出版者 / 言語: ja
• 出版者: 情報処理学会