The NP-complete problems have been shown to be hard problems in the theory of computational complexity. They include many problems of great significance both in theory and in practice. If there is a fast (in the sense...The NP-complete problems have been shown to be hard problems in the theory of computational complexity. They include many problems of great significance both in theory and in practice. If there is a fast (in the sense of polynomial time) algorithm for the dual problem of an NP-complete problem, then there are fast algorithms for all. But so far,展开更多
针对非循环概念提出了一种对SHOIN(D)-概念可满足性进行判断的方法——CDNF(complete disjunctive normal form)算法.该算法通过把非循环定义的概念描述本身构建成分层次的析取范式群,并通过子句重用技术阻止无谓的子概念扩展,这样的析...针对非循环概念提出了一种对SHOIN(D)-概念可满足性进行判断的方法——CDNF(complete disjunctive normal form)算法.该算法通过把非循环定义的概念描述本身构建成分层次的析取范式群,并通过子句重用技术阻止无谓的子概念扩展,这样的析取范式群具有可满足性自明性,从而可以实现对SHOIN(D)-概念可满足性的直接判断.该算法基本上消除了判断过程中描述重复的现象,从而在空间、时间性能上都比Tableau算法有更好的表现.关键词:描述逻辑推理;可满足性;析取范式;SHOIN(D);展开更多
基金Project supported by the National Natural Science Foundation of China
文摘The NP-complete problems have been shown to be hard problems in the theory of computational complexity. They include many problems of great significance both in theory and in practice. If there is a fast (in the sense of polynomial time) algorithm for the dual problem of an NP-complete problem, then there are fast algorithms for all. But so far,
文摘针对非循环概念提出了一种对SHOIN(D)-概念可满足性进行判断的方法——CDNF(complete disjunctive normal form)算法.该算法通过把非循环定义的概念描述本身构建成分层次的析取范式群,并通过子句重用技术阻止无谓的子概念扩展,这样的析取范式群具有可满足性自明性,从而可以实现对SHOIN(D)-概念可满足性的直接判断.该算法基本上消除了判断过程中描述重复的现象,从而在空间、时间性能上都比Tableau算法有更好的表现.关键词:描述逻辑推理;可满足性;析取范式;SHOIN(D);
