中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
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:软件所图书馆_会议论文

Files in This Item:

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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Wu Gang]'s Articles
[Qi Guilin]'s Articles
[Du Jianfeng]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Wu Gang]‘s Articles
[Qi Guilin]‘s Articles
[Du Jianfeng]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace