A Heuristic Skipping Rules Algorithm On Tableau Algorithm

摘要：

Ontology description can use Description Logic (DL) language, so DLs reasoning service can be used in ontology reasoning. In each kind DL, there is a corresponding tableau algorithm to do the reasoning process. There are some sophisticated software to do DL reasoning, they using tree with conflict to decide whether a problem can be using satisfiability to solve. There are a lot of optimization methods to optimize the reasoning service, their attention on the tree structure with conflict. We propose a new algorithm, Heuristic Skipping Rules Algorithm (HSRA), to simply the rule set called by tableau algorithms, and experimentally proved the effectiveness of the HSRA.

关键词： ontology reasoning description logic tableau algorithm Heuristic algorithm

作者: Jinshan He Liang Hu Kuo Zhao Zhanwei Du

作者单位: College of Computer Science and Technology Jilin University Changchun, P.R. China

会议类型: 国际会议

会议名称: 2012 International Conference on Computer Science and Electronic Engineering(2012 IEEE计算机科学与电子工程国际会议 ICCSEE 2012)

会议地点: 杭州

会议语种:英文

页码: 292-295

在线出版日期: 2012-03-23（万方平台首次上网日期，不代表论文的发表时间）