An algebraic approach to revising propositional rule-based knowledge bases

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, algorithms 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.knowledge base revision, consistency check, rule-based knowledge base, Petri net

Redundancy Reduction Algorithms in Rule-Based Knowledge Bases

“…For these reasons, this paper studies the redundancy rules in proposition logic 9 and gives redundancy reduction algorithms and their implementation. There is a paper that do some research in the quadratic programming to decrease the time complexity of the algorithm.…”