<テクニカルレポート>
Time-Bounded Reasoning in First Order Knowledge Base Systems

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 In first order predicate logic, it is undecidable whether a formula is deducible from a set of axioms. In order to realize a practical knowledge base system in the framework of the first order logic, ...we must overcome this problem. In this paper, we propose a time-bounded reasoning and investigate the properties of the knowledge base management system based on our time-bounded reasoning. We also show that the time-bounded reasoning is sound and valid. Furthermore, we discuss the selection of time functions and give three parameters of time functions. We also outline a prototype system we have realized in K-prolog on a Sun-3続きを見る

本文情報を非表示

rifis-tr-19 pdf 1.66 MB 86  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20