%0 Journal Article
%T A Tree-like Knowledge Base Revision Algorithm<br>一类树型知识库的更新算法
%A MA Shao-han
%A TAO Xue-hong
%A <br>马绍汉
%A 陶雪红
%J 软件学报
%D 1999
%I 
%X Knowledge base revision is to add new knowledge into the knowledge base, and to delete old knowledge if it is necessary for preserving consistency. The recently proposed knowledge base revision methods are all intractable in general case. By restricting the structure of the knowledge base, a polynomial revision algorithm is given in this paper when the corresponding constraint graph of the knowledge base is a tree. In the constraint tree, the authors use a bottom-up process to get the revision knowledge base.
%K Artificial intelligence
%K knowledge base revision
%K algorithmic complexity
%K constraint graph
%K constraint satisfiability problem<br>人工智能
%K 知识库更新
%K 算法复杂性
%K 约束图
%K 约束可满足问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=DBB847BDFA0880543D87363C89A48257&yid=B914830F5B1D1078&vid=F3090AE9B60B7ED1&iid=708DD6B15D2464E8&sid=CA21EE48F5BB8E19&eid=4206C58D935377EA&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=12