{"type":"ScholarlyArticle","title":"Complexity of Approximate Query Answering under Inconsistency in Datalog+/-","authors":[{"name":"Thomas Lukasiewicz","slug":"thomas-lukasiewicz","given":"Thomas","family":"Lukasiewicz","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Enrico Malizia","slug":"enrico-malizia","given":"Enrico","family":"Malizia","affiliation":"Department of Computer Science , University of Exeter , UK"},{"name":"Cristian Molinaro","slug":"cristian-molinaro","given":"Cristian","family":"Molinaro","affiliation":"DIMES , University of Calabria , Italy"}],"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.","doi":"10.24963/ijcai.2018/265","url":"https://ijcai.org/proceedings/2018/265","pdf":"https://ijcai.org/proceedings/2018/0265.pdf","markdown":"https://ijcai.org/proceedings/2018/265.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/265","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":265,"pages":{"first":1921,"last":1927},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[],"references":[{"position":1,"raw":"[Arenas et al., 1999] M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. PODS, pp. 68-79, 1999.","title":"Consistent query answers in inconsistent databases","authors":"M Arenas, L E Bertossi, J Chomicki","year":"1999","venue":"Proc. PODS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bienvenu and Bourgaux, 2016] M. Bienvenu and C. Bour- gaux. Inconsistency-tolerant querying of description logic knowledge bases. In Reasoning Web, pp. 156-202, 2016.","title":"Inconsistency-tolerant querying of description logic knowledge bases","authors":"M Bienvenu, C Bourgaux","year":"2016","venue":"Reasoning Web","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bienvenu and Rosati, 2013] M. Bienvenu and R. Rosati. Tractable approximations of consistent query answering for robust ontology-based data access. In Proc. IJCAI, pp. 775-781, 2013.","title":"Tractable approximations of consistent query answering for robust ontology-based data access","authors":"M Bienvenu, R Rosati","year":"2013","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/121"},{"position":4,"raw":"[Bienvenu et al., 2014a] M. Bienvenu, C. Bourgaux, and F. Goasdoué. Querying inconsistent description logic knowledge bases under preferred repair semantics. In Proc. AAAI, pp. 996-1002, 2014.","title":"Querying inconsistent description logic knowledge bases under preferred repair semantics","authors":"Bienvenu","year":"2014","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bienvenu et al., 2014b] M. Bienvenu, B. ten Cate, C. Lutz, and F. Wolter. Ontology-based data access: A study through disjunctive Datalog, CSP, and MMSNP. ACM Trans. Database Syst., 39(4):33:1-33:44, 2014.","title":"Ontology-based data access: A study through disjunctive Datalog, CSP, and MMSNP","authors":"Bienvenu","year":"2014","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bienvenu et al., 2016] M. Bienvenu, C. Bourgaux, and F. Goasdoué. Explaining inconsistency-tolerant query an- swering over description logic knowledge bases. In Proc. AAAI, pp. 900-906, 2016.","title":"Explaining inconsistency-tolerant query answering over description logic knowledge bases","authors":"M Bienvenu, C Bourgaux, F Goasdoué","year":"2016","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bienvenu, 2012] M. Bienvenu. On the complexity of consis- tent query answering in the presence of simple ontologies. In Proc. AAAI, pp. 705-711, 2012.","title":"On the complexity of consistent query answering in the presence of simple ontologies","authors":"M Bienvenu","year":"2012","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Calì et al., 2012a] A. Calì, G. Gottlob, and T. Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14:57-83, 2012.","title":"A general Datalog-based framework for tractable query answering over ontologies","authors":"Calì","year":"2012","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calì et al., 2012b] A. Calì, G. Gottlob, and A. Pieris. To- wards more expressive ontology languages: The query an- swering problem. Artif. Intell., 193:87-128, 2012.","title":"Towards more expressive ontology languages: The query answering problem","authors":"Calì","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calì et al., 2013] A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive rela- tional constraints. J. Artif. Intell. Res., 48:115-174, 2013.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"A Calì, G Gottlob, M Kifer","year":"2013","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Eiter et al., 2016] T. Eiter, T. Lukasiewicz, and L. Predoiu. Generalized consistent query answering under existential rules. In Proc. KR, pp. 359-368, 2016.","title":"Generalized consistent query answering under existential rules","authors":"T Eiter, T Lukasiewicz, L Predoiu","year":"2016","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fagin et al., 2005] R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.","title":"Data exchange: Semantics and query answering","authors":"R Fagin, P G Kolaitis, R J Miller, L Popa","year":"2005","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Greco et al., 2011] G. Greco, E. Malizia, L. Palopoli, and F. Scarcello. On the complexity of core, kernel, and bar- gaining set. Artif. Intell., 175(12/13):1877-1910, 2011.","title":"On the complexity of core, kernel, and bargaining set","authors":"G Greco, E Malizia, L Palopoli, F Scarcello","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hernich et al., 2017] A. Hernich, C. Lutz, F. Papacchini, and F. Wolter. Dichotomies in ontology-mediated query- ing with the guarded fragment. In Proc. PODS, pp. 185- 199, 2017.","title":"Dichotomies in ontology-mediated querying with the guarded fragment","authors":"A Hernich, C Lutz, F Papacchini, F Wolter","year":"2017","venue":"Proc. PODS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Koutris and Suciu, 2014] P. Koutris and D. Suciu. A di- chotomy on the complexity of consistent query answering for atoms with simple keys. In Proc. ICDT, pp. 165-176, 2014.","title":"A dichotomy on the complexity of consistent query answering for atoms with simple keys","authors":"P Koutris, D Suciu","year":"2014","venue":"Proc. ICDT","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lembo et al., 2010] D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo. Inconsistency-tolerant seman- tics for description logics. In Proc. RR, pp. 103-117, 2010.","title":"Inconsistency-tolerant semantics for description logics","authors":"D Lembo, M Lenzerini, R Rosati, M Ruzzi, D F Savo","year":"2010","venue":"Proc. RR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lembo et al., 2015] D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo. Inconsistency-tolerant query answering in ontology-based data access. J. Web Sem., 33:3-29, 2015.","title":"Inconsistency-tolerant query answering in ontology-based data access","authors":"D Lembo, M Lenzerini, R Rosati, M Ruzzi, D F Savo","year":"2015","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lukasiewicz and Malizia, 2016] T. Lukasiewicz and E. Malizia. On the complexity of mCP-nets. In Proc. AAAI, pp. 558-564, 2016.","title":"On the complexity of mCP-nets","authors":"T Lukasiewicz, E Malizia","year":"2016","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lukasiewicz and Malizia, 2017] T. Lukasiewicz and E. Malizia. A novel characterization of the complexity class Θ P k based on counting and comparison. Theor. Comput. Sci., 694:21-33, 2017.","title":"A novel characterization of the complexity class Θ P k based on counting and comparison","authors":"T Lukasiewicz, E Malizia","year":"2017","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lukasiewicz et al., 2012a] T. Lukasiewicz, M. V. Martinez, and G. I. Simari. Inconsistency handling in Datalog+/-on- tologies. In Proc. ECAI, pp. 558-563, 2012.","title":"Inconsistency handling in Datalog+/-ontologies","authors":"Lukasiewicz","year":"2012","venue":"Proc. ECAI","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lukasiewicz et al., 2012b] T. Lukasiewicz, M. V. Martinez, and G. I. Simari. Inconsistency-tolerant query rewriting for linear Datalog+/-. In Datalog 2.0, pp. 123-134, 2012.","title":"Inconsistency-tolerant query rewriting for linear Datalog+","authors":"Lukasiewicz","year":"2012","venue":"Datalog","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lukasiewicz et al., 2013] T. Lukasiewicz, M. V. Martinez, and G. I. Simari. Complexity of inconsistency-tolerant query answering in Datalog+/-. In Proc. OTM, pp. 488- 500, 2013.","title":"Complexity of inconsistency-tolerant query answering in Datalog+","authors":"T Lukasiewicz, M V Martinez, G I Simari","year":"2013","venue":"Proc. OTM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lukasiewicz et al., 2015] T. Lukasiewicz, M. V. Martinez, A. Pieris, and G. I. Simari. From classical to consistent query answering under existential rules. In Proc. AAAI, pp. 1546-1552, 2015.","title":"From classical to consistent query answering under existential rules","authors":"T Lukasiewicz, M V Martinez, A Pieris, G I Simari","year":"2015","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rosati, 2011] R. Rosati. On the complexity of dealing with inconsistency in description logic ontologies. In Proc. IJCAI, pp. 1057-1062, 2011.","title":"On the complexity of dealing with inconsistency in description logic ontologies","authors":"R Rosati","year":"2011","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/181"},{"position":25,"raw":"[Schaefer, 2001] M. Schaefer. Graph Ramsey theory and the polynomial hierarchy. J. Comput. Syst. Sci., 62(2):290- 322, 2001.","title":"Graph Ramsey theory and the polynomial hierarchy","authors":"M Schaefer","year":"2001","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Vardi, 1982] M. Y. Vardi. The complexity of relational query languages (extended abstract). In Proc. STOC, pp. 137-146, 1982.","title":"The complexity of relational query languages (extended abstract)","authors":"M Y Vardi","year":"1982","venue":"Proc. STOC","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}