A Generalization of Circumscription

• 作 者: 林作铨 石纯一
• 机 构: Department of Computer Science Shantou University,Shantou 515063,Department of Computer Science Tsin
• 出 处: Journal of Computer Science and Technology
• 发表日期: 1992年02期
• 关键词: modal formulation minimization monotonic illustrated reasoning merit modality un

In this paper we firstly extend McCarthy’s circumscription to modal logics.Similar tocircumscribing predicates,we circumscribe the critical modal operator(the operator to be minimized)ina formula.The modal formulation of circumscription is completely characterized by the minimal modelsuch as the predicate circumscription,The circumscriptive ignorance of the agent’s self-knowledge bycircumscribing knowledge operator is then illustrated.We further suggest that the merit of circumscriptionis basic for non-classical logics and for the procedure from monotonic logic to nonmonotonic one.

In this paper we conveyed extend McCarthy’s circumscription to modal logics.Similar tocircumscribing predicates, we circumscribe the critical modal operator (the operator to be minimized) ina formula. The modal formulation of circumscription is completely characterized by the minimal modelsuch as the predicate circumscription, The circumscriptive ignorance of the agent’s self-knowledge by circumscribing knowledge operator is then illustrated. We further suggest that the merit of circumscriptionis basic for non-classical logics and for the procedure from monotonic logic to nonmonotonic one.