On Normalizing Strategies for Query Transformation in Predicate Circumscription

DOI
  • IWANUMA Kouji
    Dept. of Information Eng., Faculty of Eng., Yamanashi University
  • HARAO Masateru
    Dept. of Artificial Intelligence., Faculty of Information Eng., Kyushu Institute of Technology
  • NOGUCHI Shoichi
    Research Institute of Electorical Communication, Tohoku University

Bibliographic Information

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

Search this article

Abstract

<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>

Journal

Keywords

Details 詳細情報について

  • CRID
    1390285697605204608
  • NII Article ID
    110002807347
  • NII Book ID
    AN10067140
  • DOI
    10.11517/jjsai.5.5_617
  • ISSN
    24358614
    21882266
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top