论文部分内容阅读
知识库的更新意即向知识库中添加新知识，同时为维护相容性而删除旧知识．已有的知识库更新方法在通常情况下都是难解的．该文从限制问题的结构出发，给出了一种当知识库对应的约束图为树时的多项式时间更新算法．在树型约束图中，算法通过一个自底向上的过程，得到更新后的知识库．
Knowledge base updates mean adding new knowledge to the knowledge base, while removing old knowledge for compatibility. Existing knowledge base update methods are often obscure. Starting from the structure of the problem, this paper gives a polynomial time updating algorithm when the constraint graph corresponding to knowledge base is tree. In the tree constraint graph, the algorithm gets an updated knowledge base through a bottom-up process.