並列サーカムスクリプションのパラメーター消去手法

DOI

書誌事項

タイトル別名
  • Parameter Elimination Methods in Parallel Circumscription

この論文をさがす

抄録

<p>Predicates treated as variables, i. e. parameters, in parallel circumscription make it difficult to compute parallel circumscription. Therefore it is very important to develop powerful methods for eliminating parameters. In this paper, we present some parameter elimination methods in parallel circumscription. At first, we show two fundamental theorems for eliminating parameters. Next, we give two parameter elimlnation methods, which are directly derivable from those theorems. One of them is used for eliminating a parameter which occurs only positively or only negatively in a condition sentence of parallel circumscription. Another is a method for eliminating a parameter by replacing it with a formula expressing the minimal or maximal extension of the parameter. These elimination methods are systematic, and can deal with parameters such that they are quantified with both existential and universal quantifiers in the conditlon sentence. The class of parallel circumscription which can be translated into predicate circumscription by these methods is larger than the one by well known Lifschitz's method.</p>

収録刊行物

  • 人工知能

    人工知能 5 (3), 324-332, 1990-05-01

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

キーワード

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

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

問題の指摘

ページトップへ