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...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
CEUR Workshop Proceedings
2018
|