Complexity of approximate query answering under inconsistency in datalog+/-
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 thes...
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | Conference item |
| प्रकाशित: |
CEUR Workshop Proceedings
2018
|
| _version_ | 1826288623427780608 |
|---|---|
| author | Lukasiewicz, T Malizia, E Molinaro, C |
| author_facet | Lukasiewicz, T Malizia, E Molinaro, C |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-07T02:16:30Z |
| format | Conference item |
| id | oxford-uuid:a26bbad4-c37a-4b9b-9a9f-2ff4d3ff3de1 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T02:16:30Z |
| publishDate | 2018 |
| publisher | CEUR Workshop Proceedings |
| record_format | dspace |
| spelling | oxford-uuid:a26bbad4-c37a-4b9b-9a9f-2ff4d3ff3de12022-03-27T02:20:01ZComplexity of approximate query answering under inconsistency in datalog+/-Conference itemhttp://purl.org/coar/resource_type/c_5794uuid:a26bbad4-c37a-4b9b-9a9f-2ff4d3ff3de1Symplectic Elements at OxfordCEUR Workshop Proceedings2018Lukasiewicz, TMalizia, EMolinaro, CSeveral 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. |
| spellingShingle | Lukasiewicz, T Malizia, E Molinaro, C Complexity of approximate query answering under inconsistency in datalog+/- |
| title | Complexity of approximate query answering under inconsistency in datalog+/- |
| title_full | Complexity of approximate query answering under inconsistency in datalog+/- |
| title_fullStr | Complexity of approximate query answering under inconsistency in datalog+/- |
| title_full_unstemmed | Complexity of approximate query answering under inconsistency in datalog+/- |
| title_short | Complexity of approximate query answering under inconsistency in datalog+/- |
| title_sort | complexity of approximate query answering under inconsistency in datalog |
| work_keys_str_mv | AT lukasiewiczt complexityofapproximatequeryansweringunderinconsistencyindatalog AT maliziae complexityofapproximatequeryansweringunderinconsistencyindatalog AT molinaroc complexityofapproximatequeryansweringunderinconsistencyindatalog |