摘要
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.
基金
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)．
