The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
술어회전은 상식추론의 근본적인 형식화이다. 본 논문에서는 이에 대한 새로운 근사식을 연구한다. 이전 연구에서 우리는 Lifschitz의 점별 외접과 1차 프레임워크에서 조건부 외접에 대한 유한 근사치로 기능하는 일반화를 조사했습니다. 본 논문에서는 먼저 일반화된 점별 외접의 능력을 더 자세히 연구하고, 최소 모델에서 최소화된 술어가 유한한 확장만을 갖는 경우에도 그것이 완전할 수 없음을 보여주는 간단한 예를 제공합니다. 다음으로, 이러한 한계를 극복하기 위해 유한 구성적 외접이라는 새로운 근사 공식을 도입합니다. 마지막으로, 두 가지 근사 방법의 표현력을 술어 제한 스키마와 비교하고, 최소 모델 의미론과 관련하여 술어 제한 스키마의 완전성을 명확히 하기 위해 해결해야 할 개방형 문제를 제안합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kazuhiko OOTA, Koji IWANUMA, "Finite Approximations of Predicate Circumscription" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 2, pp. 475-479, February 1999, doi: .
Abstract: Predicate Circumscription is a fundamental formalization of common sense reasoning. In this paper, we study a new approximation formula of it. In our previous works, we investigated Lifschitz's pointwise circumscription and its generalization, which functions as a finite approximation to predicate circumscription in the first-order framework. In this paper, at first, we study the ability of the generalized pointwise circumscription more closely, and give a simple example which shows that it cannot be complete even when a minimized predicate has only finite extension on the minimal models. Next, we introduce a new approximation formula, called finite constructive circumscription, in order to overcome that limitation. Finally, we compare expressive power of the two approximation methods with of predicate circumscription schema, and propose a open problem that should be solved to clarify that the completeness of predicate circumscription schema with respect to minimal model semantics.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_2_475/_p
부
@ARTICLE{e82-d_2_475,
author={Kazuhiko OOTA, Koji IWANUMA, },
journal={IEICE TRANSACTIONS on Information},
title={Finite Approximations of Predicate Circumscription},
year={1999},
volume={E82-D},
number={2},
pages={475-479},
abstract={Predicate Circumscription is a fundamental formalization of common sense reasoning. In this paper, we study a new approximation formula of it. In our previous works, we investigated Lifschitz's pointwise circumscription and its generalization, which functions as a finite approximation to predicate circumscription in the first-order framework. In this paper, at first, we study the ability of the generalized pointwise circumscription more closely, and give a simple example which shows that it cannot be complete even when a minimized predicate has only finite extension on the minimal models. Next, we introduce a new approximation formula, called finite constructive circumscription, in order to overcome that limitation. Finally, we compare expressive power of the two approximation methods with of predicate circumscription schema, and propose a open problem that should be solved to clarify that the completeness of predicate circumscription schema with respect to minimal model semantics.},
keywords={},
doi={},
ISSN={},
month={February},}
부
TY - JOUR
TI - Finite Approximations of Predicate Circumscription
T2 - IEICE TRANSACTIONS on Information
SP - 475
EP - 479
AU - Kazuhiko OOTA
AU - Koji IWANUMA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1999
AB - Predicate Circumscription is a fundamental formalization of common sense reasoning. In this paper, we study a new approximation formula of it. In our previous works, we investigated Lifschitz's pointwise circumscription and its generalization, which functions as a finite approximation to predicate circumscription in the first-order framework. In this paper, at first, we study the ability of the generalized pointwise circumscription more closely, and give a simple example which shows that it cannot be complete even when a minimized predicate has only finite extension on the minimal models. Next, we introduce a new approximation formula, called finite constructive circumscription, in order to overcome that limitation. Finally, we compare expressive power of the two approximation methods with of predicate circumscription schema, and propose a open problem that should be solved to clarify that the completeness of predicate circumscription schema with respect to minimal model semantics.
ER -