Conference item icon

Conference item

Computing CQ lower-bounds over OWL2 through approximation to RSA

Abstract:

Conjunctive query (CQ) answering over knowledge bases is an important reasoning task. However, with expressive ontology languages such as OWL, query answering is computationally very expensive. The PAGOdA system addresses this issue by using a tractable reasoner to compute lower and upper-bound approximations, falling back to a fully-fledged OWL reasoner only when these bounds don’t coincide. The effectiveness of this approach critically depends on the quality of the approximations, and in th...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-030-88361-4_12

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Linacre College
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
ORCID:
0000-0001-6993-0618
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
ORCID:
0000-0002-2685-7462
Publisher:
Springer
Host title:
The Semantic Web – ISWC 2021
Series:
Lecture Notes in Computer Science
Series number:
12922
Pages:
200-216
Publication date:
2021-09-30
Acceptance date:
2021-06-23
Event title:
20th International Semantic Web Conference (ISWC 2021)
Event location:
Virtual event
Event website:
https://iswc2021.semanticweb.org/
Event start date:
2021-10-24
Event end date:
2021-10-28
DOI:
ISSN:
0302-9743
Language:
English
Keywords:
Pubs id:
1193175
Local pid:
pubs:1193175
Deposit date:
2021-08-29

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP