Complexity of Approximate Query Answering Under Inconsistency in Datalog+/-

Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro

IJCAI 2018 pp. 1921-1927

doi:10.24963/IJCAI.2018/265 /ijcai/2018/lukasiewicz2018ijcai-complexity/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Lukasiewicz et al. "Complexity of Approximate Query Answering Under Inconsistency in Datalog+/-." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/265

Markdown

[Lukasiewicz et al. "Complexity of Approximate Query Answering Under Inconsistency in Datalog+/-." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/lukasiewicz2018ijcai-complexity/) doi:10.24963/IJCAI.2018/265

BibTeX

@inproceedings{lukasiewicz2018ijcai-complexity,
  title     = {{Complexity of Approximate Query Answering Under Inconsistency in Datalog+/-}},
  author    = {Lukasiewicz, Thomas and Malizia, Enrico and Molinaro, Cristian},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {1921-1927},
  doi       = {10.24963/IJCAI.2018/265},
  url       = {https://mlanthology.org/ijcai/2018/lukasiewicz2018ijcai-complexity/}
}