<学術雑誌論文>
Complenteness of Diamond-Resolution in Or-type Knowledge Bases

作成者
本文言語
出版者
発行日
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
概要 The framework of the $ or $-type knowledge base is proposed to deal with disjunctive information in knowledge bases. Recently, it is an important problem how effectively we use information which may h...ave some incompleteness. In or-type knowledge bases, the predicate symbols are only restricted to $ or^m $, where the superscript $ m $ implies the arity, and any disjunctive information is included in a predicate as arguments. The two systems are naturally defined for the incompleteness of the disjunctive information. The one is a Box-system, where the incompleteness does not influence the deduction and the refutation. The other is a Diamond-system, where the incompleteness influences them. We have already developed the fixpoint theorem and the completeness of resolution in the Box-system. In this paper, we show the fixpoint theorem, and the completeness of resolution in the Diamond-system. Furthermore, we present an actual question-answering in an or-type knowledge base by a realized prover.続きを見る

本文情報を非表示

rifis-tr-18 pdf 2.14 MB 87 RIFIS Technical Report
p027 pdf 596 KB 77 Bulletin of Informatics and Cybernetics

詳細

レコードID
査読有無
関連情報
ISSN
NCID
登録日 2009.04.22
更新日 2017.01.20