並列サーカムスクリプションの一階論理式への等価変換

DOI

書誌事項

タイトル別名
  • An Equivalent Transformation of Parallel Circumscription into First-Order Formulas

この論文をさがす

抄録

<p>Parallel circumscription is an extension of predicate circumscription by adding parameters, which are predicates allowed to vary in the process in minimization. It is a very useful and important tool for commonsense reasoning. But, unfortunately, its direct computation is very difficult, because it is formulated as a higher-order formula. In this paper, we present an equivalent transformation method of parallel circumscription into first-order formulas. We have already presented a fundamental method for eliminating parameters of parallel circumscription and a method for transforming predicate circumscription into first-order formulas. Each of them is stronger than the well known Lifschitz's method. In this paper, based on these results, we give a sufficient condition for transforming parallel circumscription into first-order formulas, and present a transformation method which consists of the above two methods. This method can transform a complex parallel circumscription such that its condition sentence is quantified by both ∃ and ∀ quantifiers.</p>

収録刊行物

  • 人工知能

    人工知能 5 (4), 471-481, 1990-07-01

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

キーワード

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

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

問題の指摘

ページトップへ