| Title: | finding all justifications of owl entailments using tms and mapreduce |
| Author: | Wu Gang
; Qi Guilin
; Du Jianfeng
|
| Source: | International Conference on Information and Knowledge Management, Proceedings
|
| Conference Name: | 20th ACM Conference on Information and Knowledge Management, CIKM'11
|
| Conference Date: | October 24
|
| Issued Date: | 2011
|
| Conference Place: | Glasgow, United kingdom
|
| Keyword: | Knowledge management
; Semantics
|
| Indexed Type: | EI
|
| ISBN: | 9781450307178
|
| Department: | (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
|
| Sponsorship: | Special Interest Group on Information Retrieval (ACM SIGIR); ACM SIGWEB
|
| Abstract: | 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 pD*fragment, 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 pD*entailments 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. |
| English Abstract: | 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 pD*fragment, 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 pD*entailments 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. |
| Language: | 英语
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/16264
|
| Appears in Collections: | 软件所图书馆_会议论文
|
|
There are no files associated with this item.
|
| Recommended Citation: | |
Wu Gang,Qi Guilin,Du Jianfeng. finding all justifications of owl entailments using tms and mapreduce[C]. 见:20th ACM Conference on Information and Knowledge Management, CIKM'11. Glasgow, United kingdom. October 24.
|
|
|
