###
DOI:
:1996.7(5):300-305

命题知识库更新的算法及其复杂性
陶雪红,孙伟,马绍汉
(山东大学计算机系,济南,250100)
THE ALGORITHM AND COMPLEXITY OF PROPOSITIONAL KNOWLEDGE BASE REVISION
Tao Xuehong,Sun Wei,Ma Shaohan
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2728   Download 2723
    Revised:March 03, 1995
> 中文摘要: 本文介绍了知识库更新的基本概念及命题知识库更新的复杂性研究现状.近年来,学者们提出了许多方法进行命题知识库的更新,一类是基于公式的方法;一类是基于模型的方法,但所有这些方法在通常情况下都是难解的.本文讨论基于公式的Ginsberg更新方法,并给出在公式个数远小于变元个数情况下的一个多项式时间算法.
Abstract:This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge base have been proposed recently by several researchers, some are formula--based methods and the others are model-based methods, but all methods are intractable in the general case. This paper discusses a formula-based method-Ginsberg's method, and presents a polynomial algorithm when the number of formulas is far less than the number of variables.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家自然科学基金资助. 本文研究得到国家自然科学基金资助.
Foundation items:
Reference text:

陶雪红,孙伟,马绍汉.命题知识库更新的算法及其复杂性.软件学报,1996,7(5):300-305

Tao Xuehong,Sun Wei,Ma Shaohan.THE ALGORITHM AND COMPLEXITY OF PROPOSITIONAL KNOWLEDGE BASE REVISION.Journal of Software,1996,7(5):300-305