检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:LUAN Shangmin DAI Guozhong LI Wei
机构地区:[1]Institute of Software, Chinese Academy of Sciences, Beijing 100080, China [2]Department of Computer Science and Technology, Beijing-University of Aeronautics and Astronautics, Beijing 100083, China
出 处:《Science in China(Series F)》2005年第6期681-692,共12页中国科学(F辑英文版)
基 金:This work was supposed by the National Fundamental Research 973 Program of China(Grand No.2002CB312103); the National Natural Science Foundation of China(Grant Nos.60033020,70371052).
摘 要:This paper presents a programmable approach to revising knowledge bases consisting of clauses. Some theorems and lemmas are shown in order to give procedures for generating maximally consistent subsets. Then a complete procedure and an incomplete procedure for generating the maximal consistent subsets are presented, and the correctness of the procedures is also shown. Furthermore, a way to implement knowledge base revision is presented, and a prototype system is introduced. Compared with related works, the main characteristic of our approach is that the approach can be implemented by a computer program.
关 键 词:knowledge base knowledge base revision RULES predicate logic propositional logic
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222