开放逻辑中基于一优先序的R-重构  

R\|RECONSTRUCTIONS BASED ON A PRIORITY RELATION

作　　者：苏开乐[1] 

机构地区：[1]汕头大学科学院

出　　处：《计算机研究与发展》1999年第5期523-527,共5页Journal of Computer Research and Development

基　　金：国家"八六三"高技术计划;国家自然科学基金;广东省自然科学基金

摘　　要：在开放逻辑中，Ｒ－重构作为一知识库或信念集修正的结果并不唯一，有时甚至太多而难于明确计算和表示．为此，文中给出了基于一优先序的Ｒ－重构的概念．基于一优先序的Ｒ－重构往往要比Ｒ－重构少得多，不存在上述Ｒ－重构的问题，在用户给出的关于一知识库中知识的优先序时，基于该优先序的Ｒ－重构可以用来刻画对该知识库的合理维护．文中从开放逻辑中的模型论概念——事实反驳出发，给出了基于优先序的重构的定义，刻画了这类重构的一系列重要性质，如可靠性，存在性，相对于优先序关系的单调性，以及连续性等．In open logic the notion of R\|reconstruction plays an essential role. However, R\|reconstructions can be too numerous to compute and to list out. Based on a priority relation a new notion of R\|reconstruction is proposed, which does not have the problem mentioned above. Moreover, the notion is reasonable in characterizing the update of a knowledge base when some priority relation among the pieces of the knowledge base is given. Starting by the model\|theoretic notion of rejection by fact in open logic, the definition of R\|reconstruction is given based on priority relation. Then proved are a series of important properties about this kind of R\|reconstructions, including soundness, existence, monotonicity, and continuity.

关 键 词：信念修正 优先序 R-重构 人工智能 开放逻辑 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]