An Algorithm for Constructing Extensions of Propositional Autoepistemic Logic

• Item type: JInfP(1)
• 公開日: 1992-03-31
• タイトル: An Algorithm for Constructing Extensions of Propositional Autoepistemic Logic
• タイトル / 言語: en
• タイトル: An Algorithm for Constructing Extensions of Propositional Autoepistemic Logic
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Communication Engineering Faculty of Engineering Osaka University
• 著者所属: Department of Communication Engineering Faculty of Engineering Osaka University
• 著者所属: Department of Communication Engineering Faculty of Engineering Osaka University
• 著者所属(英): en
• 著者所属(英): Department of Communication Engineering, Faculty of Engineering, Osaka University
• 著者所属(英): en
• 著者所属(英): Department of Communication Engineering, Faculty of Engineering, Osaka University
• 著者所属(英): en
• 著者所属(英): Department of Communication Engineering, Faculty of Engineering, Osaka University
• 著者名: Noboru, Babaguchi; Jun-IchiMoriuma; Yoshikazu, Tezuka
• 著者名(英): Noboru, Babaguchi; Jun-Ichi, Moriuma; Yoshikazu, Tezuka
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA00700121
• 書誌情報: Journal of Information Processing; 巻 15, 号 1, p. 72-78, 発行日 1992-03-31
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-6652
• 出版者 / 言語: ja
• 出版者: 情報処理学会