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 |
| 会议日期 | October 24 |
| 会议地点 | Glasgow, United kingdom |
| 关键词 | Knowledge management Semantics |
| 页码 | 1425-1434 |
| 中文摘要 | 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. |
| 英文摘要 | 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. |
| 收录类别 | EI |
| 会议主办者 | Special Interest Group on Information Retrieval (ACM SIGIR); ACM SIGWEB |
| 会议录 | International Conference on Information and Knowledge Management, Proceedings
 |
| 语种 | 英语 |
| ISBN号 | 9781450307178 |
| 源URL | [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]. 见:20th ACM Conference on Information and Knowledge Management, CIKM'11. Glasgow, United kingdom. October 24. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。