An Equivalent Transformation of Non-Recursive Predicate Circumscription to First-Order Formulas

DOI
  • IWANUMA Kouji
    Dept. of Electrical Eng. and Computer Science, Faculty of Eng., Yamanashi University
  • HARAO Masateru
    Dept. of Artificial Intelligence., Faculty of Infor. Eng., Kyushu Institute of Technology

Bibliographic Information

Other Title
  • 非再帰的な述語サーカムスクリプションの一階論理式への等価変換

Search this article

Abstract

<p>In this paper, we present a method which transforms predicate circumscription into a first-order sentence if its condition sentence is non-recursive with respect to predicates to be minimized. So far, fundamentally, the concept of the recursion in aribitrary first-order formulas has not been so clear. Therefore, at first, we consider and formalize this concept. Next, we define a computational condition that a formula is non-recursive with respect to predicates, and give an equivalent transformation method of non-recursive predicate circumscription into first-order sentences. A non-recursive formula A with respect to predicates p_1,…,p_n is defined only by the relations between positive and negative occurrences of p_1,…,p_n in A, without considering the number of the occurrences or the kinds of the quantification. Therefore, this transfomation method can deal with complex predicate circumscription such that its condition sentence is non-definite with respect to minimized predicates, or is quantified with both existential and universal quantifiers in any forms.</p>

Journal

Keywords

Details 詳細情報について

  • CRID
    1390004222628505600
  • NII Article ID
    110002807328
  • NII Book ID
    AN10067140
  • DOI
    10.11517/jjsai.5.4_462
  • ISSN
    24358614
    21882266
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top