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...
Auteurs principaux: | Lukasiewicz, T, Malizia, E, Molinaro, C |
---|---|
Format: | Conference item |
Publié: |
CEUR Workshop Proceedings
2018
|
Documents similaires
-
Complexity of approximate query answering under inconsistency in Datalog+/-
par: Lukasiewicz, T, et autres
Publié: (2018) -
Complexity of inconsistency-tolerant query answering in Datalog+/- under cardinality-based repairs
par: Lukasiewicz, T, et autres
Publié: (2019) -
Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄−
par: Lukasiewicz, T, et autres
Publié: (2013) -
Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄−
par: Lukasiewicz, T, et autres
Publié: (2013) -
Explanations for inconsistency-tolerant query answering under existential rules
par: Lukasiewicz, T, et autres
Publié: (2020)