finding all justifications of owl entailments using tms and mapreduce

ISCAS OpenIR

	finding all justifications of owl entailments using tms and mapreduce
	Wu Gang; Qi Guilin; Du Jianfeng
	2011
会议名称	20th ACM Conference on Information and Knowledge Management, CIKM'11
会议录名称	International Conference on Information and Knowledge Management, Proceedings
页码	1425-1434
会议日期	October 24
会议地点	Glasgow, United kingdom
收录类别	EI
ISBN	9781450307178
部门归属	(1) Key Laboratory of Medical Image Computing (NEU) Ministry of Education Shenyang 110004 China; (2) College of Information Science and Engineering Northeastern University Shenyang 110004 China; (3) School of Computer Science and Engineering Southeast University Nanjing 210096 China; (4) Guangdong University of Foreign Studies Guangzhou 510006 China; (5) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China
摘要	Finding all justifications of an OWL entailment is an important reasoning service for explaining logical inconsistencies. In this paper, we consider finding all justifications of an entailment in OWL pDfragment, which is a fragment of OWL that makes possible decidable rule extensions of OWL. We first propose a novel approach to find all justifications of OWL pDentailments using TMS and show the complexity of this approach. This approach is limited by the hardware capabilities of standalone systems. In order to improve its scalability to handle large scale semantic data, we optimize the proposed approach by exploiting the MapReduce technology. We implement our approach and the optimization, and do experiments on synthetic and real world data sets. Evaluation results show that our approach has the ability to scale to more than one billion triples. © 2011 ACM.; Finding all justifications of an OWL entailment is an important reasoning service for explaining logical inconsistencies. In this paper, we consider finding all justifications of an entailment in OWL pDfragment, which is a fragment of OWL that makes possible decidable rule extensions of OWL. We first propose a novel approach to find all justifications of OWL pDentailments using TMS and show the complexity of this approach. This approach is limited by the hardware capabilities of standalone systems. In order to improve its scalability to handle large scale semantic data, we optimize the proposed approach by exploiting the MapReduce technology. We implement our approach and the optimization, and do experiments on synthetic and real world data sets. Evaluation results show that our approach has the ability to scale to more than one billion triples. © 2011 ACM.
关键词	Knowledge Management Semantics
主办者	Special Interest Group on Information Retrieval (ACM SIGIR); ACM SIGWEB
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16264
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Wu Gang,Qi Guilin,Du Jianfeng. finding all justifications of owl entailments using tms and mapreduce[C],2011:1425-1434.