| 消除子句冗余的算法及复杂性 |
| |
| 引用本文： | 任国珍,马绍汉.消除子句冗余的算法及复杂性[J].计算机研究与发展,1996,33(11):858-864. |
| |
| 作者姓名： | 任国珍 马绍汉 |
| |
| 作者单位： | 山东大学计算机系 |
| |
| 摘 要： | 本文讨论了知识子句表示的冗余消除，着重讨论了子句中冗余文字的消除的民政部压缩是消除子句文字冗余的一种重要类型除对这种类型的问题的可判定性以及复杂性结果进行讨论外，本文还给出了压缩问题的一个子问题的多项式算法。
|
| 关 键 词： | 人工智能 知识表达 子句冗余 算法 |
AN ALGORITHM OF REMOVING REDUNDANCY FROM CLAUSE AND ITS COMPLEXITY |
| |
| Ren Guozhen and Ma Skaohan.AN ALGORITHM OF REMOVING REDUNDANCY FROM CLAUSE AND ITS COMPLEXITY[J].Journal of Computer Research and Development,1996,33(11):858-864. |
| |
| Authors: | Ren Guozhen and Ma Skaohan |
| |
| Abstract: | This paper deals with the problem of removing redundancy from a given clause, and discusses the case of redundant literals elimination in a clause. Condensing is one important type of redundancy elimination. We first consider the decidability and complexity of this problem, and then gives a polynomial algorithm of its sub-problem. |
| |
| Keywords: | Subsume condensing imply |
| 本文献已被 CNKI 维普 等数据库收录！ |
