An algebraic approach to revising propositional rule-based knowledge bases |
| |
Authors: | Luan ShangMin and Dai GuoZhong |
| |
Affiliation: | (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 |
| |
Abstract: | 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. |
| |
Keywords: | knowledge base revision consistency check rule-based knowledge base Petri net |
本文献已被 维普 SpringerLink 等数据库收录! |
|