3値論理におけるアブダクション
スポンサーリンク
概要
- 論文の詳細を見る
Eshghi and Kowalski's abductive procedure is not in general sound with respect to the 2-valued stable model semantics, but sound with respect to preferred extension(Dung, 1991). We establish an abduction framework in which a newly proposed integrity constraint allows atoms to be underivable from the theory and the abducibles. In correlation with the newly proposed integrity constraint, we present a phase of derivations augmented to Eshghi and Kowalski's abductive procedure, by which abductive unsucceeding derivations are adjusted as detections of underivability. By dealing with alternating fixpoint semantics as in[Van Gelder 93], in relation with our constraint, we see, with respect to our constraint, the soundness of Eshghi and Kowalski's abductive procedure. The motive of considering such a adjusty derivation comes up from a relaxation that there may be some atom which is not a logical consequence of P^* ∪ Δ and whose negation is neither a logical consequence. Finally the purpose of the paper is(1)to relax the constraint that all the(ground)atom or its negation should be the logical consequence of the union of a given theory and abducibles, and to get a constraint in which some atom may not be cared, (2)to extend Eshghi and Kowalski's abductive procedure to the one with an adjusty derivation phase, sound with respect to our constraint.
- 社団法人人工知能学会の論文
- 1998-09-01
著者
関連論文
- 調整と無限導出を伴うアブダクティブ手続き
- 拡張論理プログラムに対する矛盾解消アブダクションの枠組
- 一般プログラムに対する矛盾解消交替演算子
- 3値アブダクション枠組における一貫性制約と意味論
- 3値アブダクティブ証明手続き
- 3値アブダクション枠組の意味論
- 一般プログラムに対する矛盾解消交替演算子
- 3値論理におけるアブダクション
- 状況理論に基づくプランニング争点解消手法
- 安全でないSLDNF導出に基づくアブダクション手続きの正当性
- 矛盾による否定と二重否定問題
- 一般論理プログラムに対する安全でないSLDNF導出と最小不動点意味論
- データフローネットワークに基づく論理プログラムの計算機構と意味論(ソフトウェア科学・工学における数理的方法)