首页 | 本学科首页   官方微博 | 高级检索  
     

A Programmable Approach to Maintenance of a Finite Knowledge Base
作者姓名:栾尚敏  戴国忠  李未
作者单位:[1]InstituteofSoftware,TheChineseAcademyofSciences,Beijing100080,P.R,China [2]DepartemntofComputerScienceandEngineering,BeijingUniversityofAeronauticsandAstronauticsBeijing100088,P.R.Chi
基金项目:This work is supported by the Chinese National Foundation of Science under Grant Nos.60033020,and 60103020 and China Postdoctoral Science Foundation.
摘    要: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 clause A and whose output is a set of minimal subsets of Γwhich are inconsistent with A.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.

关 键 词:知识库  程序法  命题逻辑法

A programmable approach to maintenance of a finite knowledge base
Luan?ShangMin?Email author,Dai?GuoZhong,Li?Wei.A Programmable Approach to Maintenance of a Finite Knowledge Base[J].Journal of Computer Science and Technology,2003,18(1):0-0.
Authors:Email author" target="_blank">Luan?ShangMin?Email author  Dai?GuoZhong  Li?Wei
Affiliation:(1) Institute of Software, The Chinese Academy of Sciences, 100080 Beijing, P.R. China;(2) Department of Computer Science and Engineering, Beijing University of Aeronautics and Astronautics, 100083 Beijing, P.R. China
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.
Keywords:knowledge base maintenance  propositional logic  predicate logic  clause set
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号