Parallel ABox reasoning of ε L ontologies

Yuan Ren*, Jeff Z. Pan, Kevin Lee

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

In order to support the vision of the Semantic Web, ontology reasoning needs to be highly scalable and efficient. A natural way to achieve scalability and efficiency is to develop parallel ABox reasoning algorithms for tractable OWL 2 profiles to distribute the load between different computation units within a reasoning system. So far there have been some work on parallel ABox reasoning algorithms for the pD*fragment of OWL 2 RL. However, there is still no work on parallel ABox reasoning algorithm for OWL 2 EL, which is the language for many influential ontologies (such as the SNOMED CT ontology). In this paper, we extend a parallel TBox reasoning algorithm [5] for εLH R+ to parallel ABox reasoning algorithms for εLH ⊥,R+, which also supports the bottom concept so as to model disjointness and inconsistency. In design of algorithms, we exploit the characteristic of ABox reasonings to improve parallelisation and reduce unnecessary resource cost. Our evaluation shows that a naive implementation of our approach can compute all ABox entailments of a Not-Galen- ontology with about 1 million individuals and 9 million axioms in about 3 minutes.

Original languageEnglish
Title of host publicationThe Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings
Pages17-32
Number of pages16
DOIs
Publication statusPublished - 18 Jun 2012
EventJoint International Semantic Technology Conference, JIST 2011 - Hangzhou, China
Duration: 4 Dec 20117 Dec 2011
https://dblp.org/db/conf/aswc/jist2011 (Link to Conference papers)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7185 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceJoint International Semantic Technology Conference, JIST 2011
CountryChina
CityHangzhou
Period4/12/117/12/11
Internet address

Fingerprint

Ontology
Reasoning
Semantic Web
Design of Algorithms
Scalability
Inconsistency
Parallelization
Axioms
Fragment
Resources
Unit
Costs
Evaluation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ren, Y., Pan, J. Z., & Lee, K. (2012). Parallel ABox reasoning of ε L ontologies. In The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings (pp. 17-32). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7185 LNCS). https://doi.org/10.1007/978-3-642-29923-0_2

Parallel ABox reasoning of ε L ontologies. / Ren, Yuan; Pan, Jeff Z.; Lee, Kevin.

The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings. 2012. p. 17-32 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7185 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ren, Y, Pan, JZ & Lee, K 2012, Parallel ABox reasoning of ε L ontologies. in The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7185 LNCS, pp. 17-32, Joint International Semantic Technology Conference, JIST 2011, Hangzhou, China, 4/12/11. https://doi.org/10.1007/978-3-642-29923-0_2
Ren Y, Pan JZ, Lee K. Parallel ABox reasoning of ε L ontologies. In The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings. 2012. p. 17-32. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-29923-0_2
Ren, Yuan ; Pan, Jeff Z. ; Lee, Kevin. / Parallel ABox reasoning of ε L ontologies. The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings. 2012. pp. 17-32 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9466d476c87f4c1eaa686732fab95152,
title = "Parallel ABox reasoning of ε L ontologies",
abstract = "In order to support the vision of the Semantic Web, ontology reasoning needs to be highly scalable and efficient. A natural way to achieve scalability and efficiency is to develop parallel ABox reasoning algorithms for tractable OWL 2 profiles to distribute the load between different computation units within a reasoning system. So far there have been some work on parallel ABox reasoning algorithms for the pD*fragment of OWL 2 RL. However, there is still no work on parallel ABox reasoning algorithm for OWL 2 EL, which is the language for many influential ontologies (such as the SNOMED CT ontology). In this paper, we extend a parallel TBox reasoning algorithm [5] for εLH R+ to parallel ABox reasoning algorithms for εLH ⊥,R+, which also supports the bottom concept so as to model disjointness and inconsistency. In design of algorithms, we exploit the characteristic of ABox reasonings to improve parallelisation and reduce unnecessary resource cost. Our evaluation shows that a naive implementation of our approach can compute all ABox entailments of a Not-Galen- ontology with about 1 million individuals and 9 million axioms in about 3 minutes.",
author = "Yuan Ren and Pan, {Jeff Z.} and Kevin Lee",
year = "2012",
month = "6",
day = "18",
doi = "10.1007/978-3-642-29923-0_2",
language = "English",
isbn = "9783642299223",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "17--32",
booktitle = "The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings",

}

TY - GEN

T1 - Parallel ABox reasoning of ε L ontologies

AU - Ren, Yuan

AU - Pan, Jeff Z.

AU - Lee, Kevin

PY - 2012/6/18

Y1 - 2012/6/18

N2 - In order to support the vision of the Semantic Web, ontology reasoning needs to be highly scalable and efficient. A natural way to achieve scalability and efficiency is to develop parallel ABox reasoning algorithms for tractable OWL 2 profiles to distribute the load between different computation units within a reasoning system. So far there have been some work on parallel ABox reasoning algorithms for the pD*fragment of OWL 2 RL. However, there is still no work on parallel ABox reasoning algorithm for OWL 2 EL, which is the language for many influential ontologies (such as the SNOMED CT ontology). In this paper, we extend a parallel TBox reasoning algorithm [5] for εLH R+ to parallel ABox reasoning algorithms for εLH ⊥,R+, which also supports the bottom concept so as to model disjointness and inconsistency. In design of algorithms, we exploit the characteristic of ABox reasonings to improve parallelisation and reduce unnecessary resource cost. Our evaluation shows that a naive implementation of our approach can compute all ABox entailments of a Not-Galen- ontology with about 1 million individuals and 9 million axioms in about 3 minutes.

AB - In order to support the vision of the Semantic Web, ontology reasoning needs to be highly scalable and efficient. A natural way to achieve scalability and efficiency is to develop parallel ABox reasoning algorithms for tractable OWL 2 profiles to distribute the load between different computation units within a reasoning system. So far there have been some work on parallel ABox reasoning algorithms for the pD*fragment of OWL 2 RL. However, there is still no work on parallel ABox reasoning algorithm for OWL 2 EL, which is the language for many influential ontologies (such as the SNOMED CT ontology). In this paper, we extend a parallel TBox reasoning algorithm [5] for εLH R+ to parallel ABox reasoning algorithms for εLH ⊥,R+, which also supports the bottom concept so as to model disjointness and inconsistency. In design of algorithms, we exploit the characteristic of ABox reasonings to improve parallelisation and reduce unnecessary resource cost. Our evaluation shows that a naive implementation of our approach can compute all ABox entailments of a Not-Galen- ontology with about 1 million individuals and 9 million axioms in about 3 minutes.

UR - http://www.scopus.com/inward/record.url?scp=84862229187&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-29923-0_2

DO - 10.1007/978-3-642-29923-0_2

M3 - Conference contribution

SN - 9783642299223

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 17

EP - 32

BT - The Semantic Web - Joint International Semantic Technology Conference, JIST 2011, Proceedings

ER -