質問変換に基づく並列サーカムスクリプションの計算手法
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we give a new method for computing parallel circumscription based on an equivalent transformation of queries. Circ [A;Γ;Δ] ⊧ B, is equivalent to A ⊧ B if B has no negative occurrences of predicates of Γ and no occurrences of predicates of Δ. Therefore, if B satisfies these conditions, then the computation of Circ [A;Γ;Δ] ⊧ B can be reduced into the first-order computation of A ⊧ B. In general, the queries B don't satisfy the above conditions, but, sometimes, they can be transformed into the above computational sentences. In this paper, we present an equivalent transformation method of queries into the above computational sentences, and formalize it in the form of the resolution. This transformation method replaces a negative occurrence of a minimized predicate with the formula representing its minimal extension. It is similar to the unfolding in logic programming. This transformation method is intuitionally very clear, and can deal with theories consisting of both recursive and non-definite clauses.
- 1990-09-01
論文 | ランダム
- 0317 慢性心不全におけるCarvedilolの中 : 長期成績と有用性
- 8.脳卒中片麻痺患者のADL再獲得における左・右大脳半球症候群のかかわり(脳卒中)(第25回日本リハビリテーション医学会総会)
- 8.心筋のグリコーゲン代謝 : 特に骨格筋との比較および虚血性心疾患との関連性について(呼吸・循環器)
- 4. 脳卒中片麻痺の肩部痛に対する治療の検討(脳卒中)(第24回日本リハビリテーション医学会総会)
- 21. 神経・筋疾患の病態生理に関する研究(第1報) : 健常家兎骨格筋におけるグリコーゲン代謝, 特にヒラメ筋および大腿四頭筋について(基礎)