An Algorithm for Constructing Extensions of Propositional Autoepistemic Logic

概要

論文の詳細を見る
Moore's Autoepistemic Logic(AL) would be one of the most promising formalizations of nonmonotonic reasoning for its desirable properties as a logic. AL is intended to model the beliefs of an ideal1y rational agent reflecting upon his own beliefs. An important notion for AL is an extension which is the possible set of conclusions drawn by autoepistemic reasoning. Constructing extensions may be viewed as realizing autoepistemic reasoning. However, one of AL's theoretical prob1ems is nonconstructive character: Given a set of premises, it is difficult to construct extensions straightforwardly. In this paper, we propose an algorithm for constructing extensions for propositional AL. In order to resolve the difficulty as stated above, we consider AL on possible world semantics, and present a new important theorem specifying the relationship between extensions and possible world interpretation. Based on this theorem, we embody the algorithm. Also we clarify that this algorithm is sound and complete, as well as that its complexity is O(n2^n). Finally shown are some execution results of the implemented algorithm.
一般社団法人情報処理学会の論文
1992-03-31