述語サーカススクリプションにおける質問変換の正規化戦略

DOI

書誌事項

タイトル別名
  • On Normalizing Strategies for Query Transformation in Predicate Circumscription

この論文をさがす

抄録

<p>The computation of Circ [A ; Γ] &models; B can be reduced into the first-order one of A &models; C, if the query B can be transformed into a sentence C such that C is equivalent to B and has no negative occurrences of any minimized predicates p∈Γ. In the previous paper, we presented a rule for equivalently transforming the queries B into the above computational sentences C. But, in general, by this transformation rule, a query may be transformed in several ways. Therefore, it is important to consider a normalizing strategy, which controls the query transformation in such a way that the above computational sentence, i. e., a normalized sentence, can be always obtained if such a sentence exists. In this paper, we investigate normalizing strategies for the above equivalent transformation of queries in predicate circumscription. As a result, we show that a fair transformation strategy is a normalizing one. Through the proof, we also show that the query normalization can be regarded as a kind of the derivation of a finitely failed SLD-tree in logic programming.</p>

収録刊行物

  • 人工知能

    人工知能 5 (5), 617-626, 1990-09-01

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

キーワード

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

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

問題の指摘

ページトップへ