An algebraic approach to revising propositional rule-based knowledge bases

查看全文 作　　者：LUAN [1,2]ShangMin;DAI [2]GuoZhong

机构地区：[1]School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;[2]Institute of Software, Chinese Academy of Sciences, Beijing 100080, China

出　　处：《Science in China(Series F)》索引2008年第51卷第3期,共18页

基　　金：Supported by the National Grand Fundamental Research 973 Program of China (Grant No. 2002CB312103) 摘　　要：One of the important topics in knowledge base revision is to introduce an efficient implementation algorithm. Algebraic approaches have good characteristics and implementation method; they may be a choice to solve the problem. An algebraic approach is presented to revise propositional rule-based knowledge bases in this paper. A way is firstly introduced to transform a propositional rule-based knowledge base into a Petri net. A knowledge base is represented by a Petri net, and facts are represented by the initial marking. Thus, the consistency check of a knowledge base is equivalent to the reachability problem of Petri nets. The reachability of Petri nets can be decided by whether the state equation has a solution; hence the consistency check can also be implemented by algebraic approach. Furthermore, al-gorithms are introduced to revise a propositional rule-based knowledge base, as well as extended logic programming. Compared with related works, the algorithms presented in the paper are efficient, and the time complexities of these algorithms are polynomial. 关键词：知识基础修订稠度 PETRI网代数逼近

相关文献

参考文献（18）
引证文献（2）
耦合文献（11）

参考文献(18)

引证文献(2)

耦合文献(11)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

An algebraic approach to revising propositional rule-based knowledge bases

参考文献(18)

引证文献(2)

耦合文献(11)

用户提示