Conference item icon

Conference item

Complexity of approximate query answering under inconsistency in datalog+/-

Abstract:
Several semantics have been proposed to query inconsistent ontological knowledge bases, including the intersection of repairs and the intersection of closed repairs as two approximate inconsistency-tolerant semantics. In this paper, we analyze the complexity of conjunctive query answering under these two semantics for a wide range of Datalog+/- languages. We consider both the standard setting, where errors may only be in the database, and the generalized setting, where also the rules of a Datalog+/- knowledge base may be erroneous.
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
ORCID:
0000-0002-7644-1668
Malizia, E More by this author
Molinaro, C More by this author
Publisher:
CEUR Workshop Proceedings Publisher's website
Pages:
166-173
Publication date:
2018-10-01
Acceptance date:
2018-05-30
ISSN:
1613-0073
Pubs id:
pubs:909289
URN:
uri:a26bbad4-c37a-4b9b-9a9f-2ff4d3ff3de1
UUID:
uuid:a26bbad4-c37a-4b9b-9a9f-2ff4d3ff3de1
Local pid:
pubs:909289
ISBN:
9781510869639

Terms of use


Metrics



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

TO TOP