Completeness guaranteed approximation for OWL DL query answering

Jeff Z. Pan*, Edward Thomas, Yuting Zhao

*Corresponding author for this work

Research output: Contribution to journalConference article

8 Citations (Scopus)

Abstract

How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a soundness guaranteed approximation, which transforms an ontology in a more expressive DL to its least upper bound approximation in a tractable DL. In this paper, we investigate a completeness guaranteed approximation, based on transformations of both the source ontology and input queries. We have implemented both soundness guaranteed and completeness guaranteed approximations in our TrOWL ontology reasoning infrastructure.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalCEUR Workshop Proceedings
Volume477
Publication statusPublished - 1 Dec 2009
Event22nd International Workshop on Description Logics, DL 2009 - Oxford, United Kingdom
Duration: 27 Jul 200930 Jul 2009
http://www.cs.ox.ac.uk/DL2009/ (Link to Official Website)

Fingerprint

Ontology
Knowledge representation

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Completeness guaranteed approximation for OWL DL query answering. / Pan, Jeff Z.; Thomas, Edward; Zhao, Yuting.

In: CEUR Workshop Proceedings, Vol. 477, 01.12.2009, p. 1-12.

Research output: Contribution to journalConference article

Pan, Jeff Z. ; Thomas, Edward ; Zhao, Yuting. / Completeness guaranteed approximation for OWL DL query answering. In: CEUR Workshop Proceedings. 2009 ; Vol. 477. pp. 1-12.
@article{0d8b827f30864b3c9232600158be79d9,
title = "Completeness guaranteed approximation for OWL DL query answering",
abstract = "How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a soundness guaranteed approximation, which transforms an ontology in a more expressive DL to its least upper bound approximation in a tractable DL. In this paper, we investigate a completeness guaranteed approximation, based on transformations of both the source ontology and input queries. We have implemented both soundness guaranteed and completeness guaranteed approximations in our TrOWL ontology reasoning infrastructure.",
author = "Pan, {Jeff Z.} and Edward Thomas and Yuting Zhao",
year = "2009",
month = "12",
day = "1",
language = "English",
volume = "477",
pages = "1--12",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Completeness guaranteed approximation for OWL DL query answering

AU - Pan, Jeff Z.

AU - Thomas, Edward

AU - Zhao, Yuting

PY - 2009/12/1

Y1 - 2009/12/1

N2 - How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a soundness guaranteed approximation, which transforms an ontology in a more expressive DL to its least upper bound approximation in a tractable DL. In this paper, we investigate a completeness guaranteed approximation, based on transformations of both the source ontology and input queries. We have implemented both soundness guaranteed and completeness guaranteed approximations in our TrOWL ontology reasoning infrastructure.

AB - How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a soundness guaranteed approximation, which transforms an ontology in a more expressive DL to its least upper bound approximation in a tractable DL. In this paper, we investigate a completeness guaranteed approximation, based on transformations of both the source ontology and input queries. We have implemented both soundness guaranteed and completeness guaranteed approximations in our TrOWL ontology reasoning infrastructure.

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

M3 - Conference article

VL - 477

SP - 1

EP - 12

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -