Stable Model Semantics of Circumscription
スポンサーリンク
概要
- 論文の詳細を見る
Circumscription, which is an important tool for formalizing nonmonotonic aspects of commonsense reasoning, is a minimization on predicate symbols. In this paper, we apply circumscription to logic programs, and compare the semantics of circumscription with the stable model semantics of logic programs. We introduce two syntactical conditions, a minimality condition and a uniqueness condition, which determine how to minimize predicate symbols. We show that each of them also deter mines a unique model of circumscription of a logic program, and each model coincides with a unique stable model of the program as the declarative semantics.
- Research Association of Statistical Sciencesの論文
- 1992-08-11
Research Association of Statistical Sciences | 論文
- CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
- A FAMILY OF REGRESSION MODELS HAVING PARTIALLY ADDITIVE AND MULTIPLICATIVE COVARIATE STRUCTURE
- AN OPTIMAL STOPPING PROBLEM ON TREE
- ON THE ORDERS OF MAX-MIN FUNCTIONALS
- TREE EXPRESSIONS AND THEIR PRODUCT FORMULA