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...
Asıl Yazarlar: | Lukasiewicz, T, Malizia, E, Molinaro, C |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
CEUR Workshop Proceedings
2018
|
Benzer Materyaller
-
Complexity of approximate query answering under inconsistency in Datalog+/-
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2018) -
Complexity of inconsistency-tolerant query answering in Datalog+/- under cardinality-based repairs
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2019) -
Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄−
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2013) -
Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄−
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2013) -
Explanations for inconsistency-tolerant query answering under existential rules
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2020)