Approximating OWL-DL Ontologies

Jeff Z. Pan; Edward Thomas

Approximating OWL-DL Ontologies

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach guarantees also completeness. Furthermore, this paper reports on the implementation of our approach in the ONTOSEARCH2 system and preliminary, but encouraging, benchmark results which compare ONTOSEARCH2's response times on a number of queries with those of existing ontology reasoning systems.

Original language	English
Title of host publication	Proceedings of the 22nd National Conference on Artificial Intelligence - Volume 2
Editors	Anthony Cohn
Publisher	AAAI Press
Pages	1434–1439
Number of pages	6
ISBN (Electronic)	978-1-57735-324-9
ISBN (Print)	978-1-57735-323-2
Publication status	Published - 26 Jul 2007
Event	22nd national conference on Artificial intelligence - Vancouver, Canada Duration: 22 Jul 2007 → 26 Jul 2007 https://www.aaai.org/Conferences/AAAI/aaai07.php

Publication series

Name	AAAI'07
Publisher	AAAI Press

Conference

Conference	22nd national conference on Artificial intelligence
Abbreviated title	AAAI-07
Country/Territory	Canada
City	Vancouver
Period	22/07/07 → 26/07/07
Internet address	https://www.aaai.org/Conferences/AAAI/aaai07.php

Access to Document

https://www.aaai.org/Library/AAAI/2007/aaai07-227.phpLicence: All Rights Reserved

Cite this

@inproceedings{03295e7b7ffd498993c1b63e846a625a,

title = "Approximating OWL-DL Ontologies",

abstract = "Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach guarantees also completeness. Furthermore, this paper reports on the implementation of our approach in the ONTOSEARCH2 system and preliminary, but encouraging, benchmark results which compare ONTOSEARCH2's response times on a number of queries with those of existing ontology reasoning systems.",

author = "Pan, {Jeff Z.} and Edward Thomas",

year = "2007",

month = jul,

day = "26",

language = "English",

isbn = "978-1-57735-323-2",

series = "AAAI'07",

publisher = "AAAI Press",

pages = "1434–1439",

editor = "Anthony Cohn",

booktitle = "Proceedings of the 22nd National Conference on Artificial Intelligence - Volume 2",

note = "22nd national conference on Artificial intelligence, AAAI-07 ; Conference date: 22-07-2007 Through 26-07-2007",

url = "https://www.aaai.org/Conferences/AAAI/aaai07.php",

}

TY - GEN

T1 - Approximating OWL-DL Ontologies

AU - Pan, Jeff Z.

AU - Thomas, Edward

PY - 2007/7/26

Y1 - 2007/7/26

N2 - Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach guarantees also completeness. Furthermore, this paper reports on the implementation of our approach in the ONTOSEARCH2 system and preliminary, but encouraging, benchmark results which compare ONTOSEARCH2's response times on a number of queries with those of existing ontology reasoning systems.

AB - Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach guarantees also completeness. Furthermore, this paper reports on the implementation of our approach in the ONTOSEARCH2 system and preliminary, but encouraging, benchmark results which compare ONTOSEARCH2's response times on a number of queries with those of existing ontology reasoning systems.

M3 - Conference contribution

SN - 978-1-57735-323-2

T3 - AAAI'07

SP - 1434

EP - 1439

BT - Proceedings of the 22nd National Conference on Artificial Intelligence - Volume 2

A2 - Cohn, Anthony

PB - AAAI Press

T2 - 22nd national conference on Artificial intelligence

Y2 - 22 July 2007 through 26 July 2007

ER -

Approximating OWL-DL Ontologies

Abstract / Description of output

Publication series

Conference

Access to Document

Fingerprint

Cite this