{"type":"ScholarlyArticle","title":"Explanations for Query Answers under Existential Rules","authors":[{"name":"İsmail İlkan Ceylan","slug":"ismail-ilkan-ceylan","given":"İsmail İlkan","family":"Ceylan","affiliation":"Department of Computer Science , University of Oxford , UK"},{"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":"Andrius Vaicenavičius","slug":"andrius-vaicenavicius","given":"Andrius","family":"Vaicenavičius","affiliation":"Department of Computer Science , University of Oxford , UK"}],"abstract":"Ontology-mediated query answering is an extensively studied paradigm, which aims at improving query answers with the use of a logical theory. As a form of logical entailment, ontology-mediated query answering is fully interpretable, which makes it possible to derive explanations for query answers. Surprisingly, however, explaining answers for ontology-mediated queries has received little attention for ontology languages based on existential rules. In this paper, we close this gap, and study the problem of explaining query answers in terms of minimal subsets of database facts. We provide a thorough complexity analysis for several decision problems associated with minimal explanations under existential rules.","doi":"10.24963/ijcai.2019/227","url":"https://ijcai.org/proceedings/2019/227","pdf":"https://ijcai.org/proceedings/2019/0227.pdf","markdown":"https://ijcai.org/proceedings/2019/227.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/227","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":227,"pages":{"first":1639,"last":1646},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Knowledge Representation Languages"],"videos":[],"references":[{"position":1,"raw":"[Baader and Suntisrivaraporn, 2008] Franz Baader and Boontawee Suntisrivaraporn. Debugging SNOMED CT using axiom pinpointing in the description logic EL+. In Proc. KR-MED, 2008.","title":"Debugging SNOMED CT using axiom pinpointing in the description logic EL+","authors":"Suntisrivaraporn Baader, Franz Baader, Boontawee Suntisrivaraporn","year":"2008","venue":"Proc. KR-MED","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baader et al., 2007] Franz Baader, Diego Calvanese, Deb- orah L. McGuinness, Daniele Nardi, and Peter F. Patel- Schneider, editors. The Description Logic Handbook: The- ory, Implementation, and Applications. Cambridge Univer- sity Press, 2nd edition, 2007.","title":"The Description Logic Handbook: Theory, Implementation, and Applications","authors":"Franz Baader, Diego Calvanese, L Deborah","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bard and Rhee, 2004] Jonathan B. L. Bard and Seung Y. Rhee. Ontologies in biology: Design, applications and future challenges. Nat. Rev. Genet., 5:213-222, 2004.","title":"Ontologies in biology: Design, applications and future challenges","authors":"B L Jonathan, Seung Y Bard, Rhee","year":"2004","venue":"Nat. Rev. Genet","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Beeri and Vardi, 1981] Catriel Beeri and Moshe Y. Vardi. The implication problem for data dependencies. In Proc. ICALP, pages 73-85, 1981.","title":"The implication problem for data dependencies","authors":"Catriel Beeri, Moshe Y Vardi","year":"1981","venue":"Proc. ICALP","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bertaud-Gounot et al., 2012] Valérie Bertaud-Gounot, Régis Duvauferrier, and Anita Burgun. Ontology and medical diagnosis. Inform. Health Soc. Care, 37(2):51-61, 2012.","title":"Ontology and medical diagnosis","authors":"Valérie Bertaud-Gounot, Régis Duvauferrier, Anita Burgun","year":"2012","venue":"Inform. Health Soc. Care","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bienvenu et al., 2014] Meghyn Bienvenu, Balder Ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data ac- cess: A study through disjunctive Datalog, CSP, and MM- SNP. ACM Trans. Database Syst., 39(4):33:1-33:44, 2014.","title":"Ontology-based data access: A study through disjunctive Datalog, CSP, and MM-SNP","authors":"Bienvenu","year":"2014","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bienvenu et al., 2019] Meghyn Bienvenu, Camille Bour- gaux, and François Goasdoué. Computing and explaining query answers over inconsistent DL-Lite knowledge bases. J. Artif. Intell. Res., 64:563-644, 2019.","title":"Computing and explaining query answers over inconsistent DL-Lite knowledge bases","authors":"Bienvenu","year":"2019","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Borgida et al., 2008] Alexander Borgida, Diego Calvanese, and Mariano Rodriguez-Muro. Explanation in the DL-Lite family of description logics. In Proc. OTM, pages 1440- 1457, 2008.","title":"Explanation in the DL-Lite family of description logics","authors":"Alexander Borgida, Diego Calvanese, Mariano Rodriguez-Muro","year":"2008","venue":"Proc. OTM","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calì et al., 2012a] Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. J. Web Semant., 14:57-83, 2012.","title":"A general Datalog-based framework for tractable query answering over ontologies","authors":"Calì","year":"2012","venue":"J. Web Semant","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calì et al., 2012b] Andrea Calì, Georg Gottlob, and Andreas Pieris. Towards more expressive ontology languages: The query answering 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":11,"raw":"[Calì et al., 2013] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering un- der expressive relational constraints. J. Artif. Intell. Res., 48:115-174, 2013.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"Andrea Calì, Georg Gottlob, Michael Kifer","year":"2013","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Ceylan et al., 2017] İsmail İlkan Ceylan, Stefan Borgwardt, and Thomas Lukasiewicz. Most probable explanations for probabilistic database queries. In Proc. IJCAI, pages 950-956, 2017.","title":"Most probable explanations for probabilistic database queries","authors":"Ceylan","year":"2017","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/132"},{"position":13,"raw":"[Došilović et al., 2018] Filip Karlo Došilović, Mario Brčić, and Nikica Hlupić. Explainable artificial intelligence: A survey. In Proc. MIPRO, pages 210-215, 2018.","title":"Explainable artificial intelligence: A survey","authors":"Filip Karlo Došilović, Mario Brčić, Nikica Hlupić","year":"2018","venue":"Proc. MIPRO","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Eiter and Gottlob, 1995] Thomas Eiter and Georg Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput., 24(6):1278-1304, 1995.","title":"Identifying the minimal transversals of a hypergraph and related problems","authors":"Thomas Eiter, Georg Gottlob","year":"1995","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Eiter et al., 1997] Thomas Eiter, Georg Gottlob, and Heikki Mannila. Disjunctive datalog. ACM Trans. Database Syst., 22(3):364-418, 1997.","title":"Disjunctive datalog","authors":"Thomas Eiter, Georg Gottlob, Heikki Mannila","year":"1997","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Eiter et al., 2016] Thomas Eiter, Thomas Lukasiewicz, and Livia Predoiu. Generalized consistent query answering under existential rules. In Proc. KR, pages 359-368, 2016.","title":"Generalized consistent query answering under existential rules","authors":"Thomas Eiter, Thomas Lukasiewicz, Livia Predoiu","year":"2016","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fagin et al., 2005] Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: se- mantics and query answering. TCS, 336(1):89-124, 2005.","title":"Data exchange: semantics and query answering","authors":"Ronald Fagin, G Phokion, Renée J Kolaitis, Lucian Miller, Popa","year":"2005","venue":"TCS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gabow et al., 1976] Harold N. Gabow, Shachindra N. Ma- heshwari, and Leon J. Osterweil. On two problems in the generation of program test paths. IEEE Trans. Softw. Eng., SE-2(3):227-231, 1976.","title":"On two problems in the generation of program test paths","authors":"N Harold, Gabow, N Shachindra, Leon J Maheshwari, Osterweil","year":"1976","venue":"IEEE Trans. Softw. Eng., SE","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gainer-Dewar and Vera-Licona, 2017] Andrew Gainer- Dewar and Paola Vera-Licona. The minimal hitting set generation problem: Algorithms and computation. SIAM J. Discrete Math., 31(1):63-100, 2017.","title":"The minimal hitting set generation problem: Algorithms and computation","authors":"Andrew Gainer-Dewar, Paola Vera-Licona","year":"2017","venue":"SIAM J. Discrete Math","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Garey and Johnson, 1990] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"Michael R Garey, David S Johnson","year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gottlob and Malizia, 2018] Georg Gottlob and Enrico Mal- izia. Achieving new upper bounds for the hypergraph du- ality problem through logic. SIAM J. Comput., 47(2):456- 492, 2018.","title":"Achieving new upper bounds for the hypergraph duality problem through logic","authors":"Malizia Gottlob, Georg Gottlob, Enrico Malizia","year":"2018","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Horridge et al., 2008] Matthew Horridge, Bijan Parsia, and Ulrike Sattler. Laconic and precise justifications in OWL. In Proc. ISWC, pages 323-338, 2008.","title":"Laconic and precise justifications in OWL","authors":"Matthew Horridge, Bijan Parsia, Ulrike Sattler","year":"2008","venue":"Proc. ISWC","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Horridge et al., 2009] Matthew Horridge, Bijan Parsia, and Ulrike Sattler. Explaining inconsistencies in OWL ontolo- gies. In Proc. SUM, pages 124-137, 2009.","title":"Explaining inconsistencies in OWL ontologies","authors":"Matthew Horridge, Bijan Parsia, Ulrike Sattler","year":"2009","venue":"Proc. SUM","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Kalyanpur et al., 2007] Aditya Kalyanpur, Bijan Parsia, Matthew Horridge, and Evren Sirin. Finding all justifi- cations of OWL DL entailments. In Proc. ISWC/ASWC, pages 267-280, 2007.","title":"Finding all justifications of OWL DL entailments","authors":"Aditya Kalyanpur, Bijan Parsia, Matthew Horridge, Evren Sirin","year":"2007","venue":"Proc. ISWC/ASWC","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Klamt et al., 2009] Steffen Klamt, Utz-Uwe Haus, and Fabian Theis. Hypergraphs and cellular networks. PLOS Comput. Biol., 5(5):e1000385, 2009.","title":"Hypergraphs and cellular networks","authors":"Steffen Klamt, Utz-Uwe Haus, Fabian Theis","year":"2009","venue":"PLOS Comput. Biol","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Lapaugh and Papadimitriou, 1984] Andrea S. Lapaugh and Christos H. Papadimitriou. The even-path problem for graphs and digraphs. Networks, 14(4):507-513, 1984.","title":"The even-path problem for graphs and digraphs","authors":"Andrea S Lapaugh, Christos H Papadimitriou","year":"1984","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Lukasiewicz et al., 2018] Thomas Lukasiewicz, Enrico Mal- izia, and Cristian Molinaro. Complexity of approximate query answering under inconsistency in Datalog+/-. In Proc. IJCAI, pages 1921-1927, 2018.","title":"Complexity of approximate query answering under inconsistency in Datalog+","authors":"Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro","year":"2018","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/265"},{"position":28,"raw":"[Peñaloza and Sertkaya, 2017] Rafael Peñaloza and Barış Sertkaya. Understanding the complexity of axiom pin- pointing in lightweight description logics. Artif. Intell., 250:80-104, 2017.","title":"Understanding the complexity of axiom pinpointing in lightweight description logics","authors":"Sertkaya Peñaloza, Rafael Peñaloza, Barış Sertkaya","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenz- erini, and Riccardo Rosati. Linking data to ontologies. In Journal on Data Semantics X, pages 133-173. Springer- Verlag, 2008.","title":"Linking data to ontologies","authors":"Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati","year":"2008","venue":"Journal on Data Semantics X","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Ramadan et al., 2004] Emad Ramadan, Arijit Tarafdar, and Alex Pothen. A hypergraph model for the yeast protein complex network. In Proc. IPDPS, 2004.","title":"A hypergraph model for the yeast protein complex network","authors":"Emad Ramadan, Arijit Tarafdar, Alex Pothen","year":"2004","venue":"Proc. IPDPS","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Reiter, 1987] Raymond Reiter. A theory of diagnosis from first principles. Artif. Intell., 32(1):57-95, 1987.","title":"A theory of diagnosis from first principles","authors":"Raymond Reiter","year":"1987","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Sebastiani and Vescovi, 2009] Roberto Sebastiani and Michele Vescovi. Axiom pinpointing in lightweight description logics via Horn-SAT encoding and conflict analysis. In Proc. CADE, pages 84-99, 2009.","title":"Axiom pinpointing in lightweight description logics via Horn-SAT encoding and conflict analysis","authors":"Vescovi Sebastiani, Roberto Sebastiani, Michele Vescovi","year":"2009","venue":"Proc. CADE","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Suntisrivaraporn et al., 2008] Boontawee Suntisrivaraporn, Guilin Qi, Qiu Ji, and Peter Haase. A modularization- based approach to finding all justifications for OWL DL entailments. In Proc. ASWC, pages 1-15, 2008.","title":"A modularizationbased approach to finding all justifications for OWL DL entailments","authors":"Suntisrivaraporn","year":"2008","venue":"Proc. ASWC","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Vardi, 1982] Moshe Y. Vardi. The complexity of relational query languages. In Proc. STOC, pages 137-146, 1982.","title":"The complexity of relational query languages","authors":"Moshe Y Vardi","year":"1982","venue":"Proc. STOC","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}