|
计算机科学技术学报 2003
A Programmable Approach to Maintenance of a Finite Knowledge BaseKeywords: knowledge base maintenance,propositional logic,predicate logic,clause set Abstract: In this paper, we present a programmable method of revising a finite clause set. We first present a procedure whose formal parameters are a consistent clause set Γ and a clauseA and whose output is a set of minimal subsets of Γ which are inconsistent withA. The maximal consistent subsets can be generated from all minimal inconsistent subsets. We develop a prototype system based on the above procedure, and discuss the implementation of knowledge base maintenance. At last, we compare the approach presented in this paper with other related approaches. The main characteristic of the approach is that it can be implemented by a computer program. This work is supported by the Chinese National Foundation of Science under Grant Nos.60033020 and 60103020 and China Postdoctoral Science Foundation. LUAN ShangMin was born in 1968. He got his B.S. degree from Shandong University of Science and Technology in 1990, M.S. degree in computer science and software from Shandong University, and Ph.D. degree from Beijing University of Aeronautics and Astronautics in 1999. Now, he works in Institute of Software, Chinese Academy of Sciences. His interests are human-computer interaction, belief revision, artificial intelligence. DAI GuoZhong was born in 1944. Now he is a professor of Institute of Software, Chinese Academy of Sciences. His interests are human-computer interaction, computer graphic, and CAD. LI Wei was born in 1943. He is a professor of Beijing University of Aeronautics and Astronautics. He is a member of Chinese Academy of Sciences. His interests are mathematic logic, formal method, artificial intelligence.
|