A programmable approach to maintenance of a finite knowledge base

Luan, Shangmin; Dai, Guozhong; Li, Wei

doi:10.1007/bf02946657

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is hard to be implemented by a computer program. Although it is extended later [15,20,18] , these approaches also use search technique to generate maximally consistent subsets of a knowledge base. They have low efficiency.…”

Section: Related Workmentioning

confidence: 99%

“…It is more feasible to introduce efficient revision algorithms for an extended logic program since it has the declarative semantics [4] and efficient theorem prover [5] . Compared with the approaches to revising a general knowledge base [6][7][8][9][10][11][12][13][14][15][16][17][18][19] , the algorithms [20][21][22] for revising the above two kinds of knowledge bases are more feasible and efficient. However, these revision algorithms use search technique, so combinative exploration may occur in the process of revision.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An algebraic approach to revising propositional rule-based knowledge bases

Luan

Dai

2008

Sci. China Ser. F-Inf. Sci.

Self Cite

View full text Add to dashboard Cite

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

show abstract

Section: Related Workmentioning

confidence: 99%