質問変換に基づく並列サーカムスクリプションの計算手法

DOI

書誌事項

タイトル別名
  • A Computation Method for Parallel Circumscription Based on Equivalent Transformation of Queries

この論文をさがす

抄録

<p>In this paper, we give a new method for computing parallel circumscription based on an equivalent transformation of queries. Circ [A;Γ;Δ] &models; B, is equivalent to A &models; 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;Γ;Δ] &models; B can be reduced into the first-order computation of A &models; 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.</p>

収録刊行物

  • 人工知能

    人工知能 5 (5), 578-587, 1990-09-01

    一般社団法人 人工知能学会

キーワード

詳細情報 詳細情報について

  • CRID
    1390848647558598016
  • NII論文ID
    110002807343
  • NII書誌ID
    AN10067140
  • DOI
    10.11517/jjsai.5.5_578
  • ISSN
    24358614
    21882266
  • 本文言語コード
    ja
  • データソース種別
    • JaLC
    • CiNii Articles
  • 抄録ライセンスフラグ
    使用不可

問題の指摘

ページトップへ