检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yuxin YE Xianji CUI Dantong OUYANG
机构地区:[1]College of Computer Science and Technology,Jilin University,Changchun,130012,China [2]Key Lab of Symbolic Computation and Knowledge Engineering(Jilin University),Ministry of Education,Changchun,130012,China [3]College of Information and Communication Engineering,Dalian Minzu University,Dalian,116600,China
出 处:《Frontiers of Computer Science》2020年第4期55-64,共10页中国计算机科学前沿(英文版)
基 金:Research presented in this paper was partially supported by the National Natural Science Foundation of China(Grant Nos.61672261,61502199);It’s also funded by China Scholarship Council(201506175028)for the first author of this paper.
摘 要:Extracting justifications for web ontology language(OWL)ontologies is an important mission in ontology engineering.In this paper,we focus on black-box techniques which are based on ontology reasoners.Through creating a recursive expansion procedure,all elements which are called critical axioms in the justification are explored one by one.In this detection procedure,an axiom selection function is used to avoid testing irrelevant axioms.In addition,an incremental reasoning procedure has been proposed in order to substitute series of standard reasoning tests w.r.t.satisfiability.It is implemented by employing a pseudo model to detect“obvious”satisfiability directly.The experimental results show that our proposed strategy for extracting justifications for OWL ontologies by adopting incremental expansion is superior to traditional Black-box methods in terms of efficiency and performance.
关 键 词:description logics automated reasoning ontology engineering JUSTIFICATION
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7