{"type":"ScholarlyArticle","title":"Satisfaction and Implication of Integrity Constraints in Ontology-based Data Access","authors":[{"name":"Charalampos Nikolaou","slug":"charalampos-nikolaou","given":"Charalampos","family":"Nikolaou","affiliation":"Department of Computer Science , University of Oxford , UK; Infor , UK"},{"name":"Bernardo Cuenca Grau","slug":"bernardo-cuenca-grau","given":"Bernardo Cuenca","family":"Grau","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Egor V. Kostylev","slug":"egor-v-kostylev","given":"Egor V.","family":"Kostylev","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Mark Kaminski","slug":"mark-kaminski","given":"Mark","family":"Kaminski","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Ian Horrocks","slug":"ian-horrocks","given":"Ian","family":"Horrocks","affiliation":"Department of Computer Science , University of Oxford , UK"}],"abstract":"We extend ontology-based data access with integrity constraints over both the source and target schemas. The relevant reasoning problems in this setting are constraint satisfaction—to check whether a database satisfies the target constraints given the mappings and the ontology—and source-to-target (resp., target-to-source) constraint implication, which is to check whether a target constraint (resp., a source constraint) is satisfied by each database satisfying the source constraints (resp., the target constraints). We establish decidability and complexity bounds for all these problems in the case where ontologies are expressed in DL-LiteR and constraints range from functional dependencies to disjunctive tuple-generating dependencies.","doi":"10.24963/ijcai.2019/253","url":"https://ijcai.org/proceedings/2019/253","pdf":"https://ijcai.org/proceedings/2019/0253.pdf","markdown":"https://ijcai.org/proceedings/2019/253.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/253","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":253,"pages":{"first":1829,"last":1835},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Description Logics and Ontologies","Multidisciplinary Topics and Applications: Intelligent Database Systems"],"videos":[],"references":[{"position":1,"raw":"[Abiteboul and Hull, 1988] Serge Abiteboul and Richard Hull. Data functions, datalog and negation (extended ab- stract). In SIGMOD'88, pages 143-153, 1988.","title":"Data functions, datalog and negation (extended abstract)","authors":"Hull Abiteboul, Serge Abiteboul, Richard Hull","year":"1988","venue":"SIGMOD'88","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baget et al., 2011] Jean-Franc ¸ois Baget, Marie-Laure Mug- nier, Sebastian Rudolph, and Michaël Thomazo. Walk- ing the complexity lines for generalized guarded existen- tial rules. In IJCAI'11, pages 712-717, 2011.","title":"Walking the complexity lines for generalized guarded existential rules","authors":"Baget","year":"2011","venue":"IJCAI'11","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bárány et al., 2015] Vince Bárány, Balder ten Cate, and Luc Segoufin. Guarded negation. J. ACM, 62(3), 2015.","title":"Guarded negation","authors":"Vince Bárány, Luc Balder Ten Cate, Segoufin","year":"2015","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bienvenu et al., 2012] Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. Query containment in description logics reconsidered. In KR'12, 2012.","title":"Query containment in description logics reconsidered","authors":"Bienvenu","year":"2012","venue":"KR'12","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bourhis et al., 2016] Pierre Bourhis, Marco Manna, Michael Morak, and Andreas Pieris. Guarded-based disjunctive tuple-generating dependencies. ACM Trans. Database Syst., 41(4):27:1-27:45, 2016.","title":"Guarded-based disjunctive tuple-generating dependencies","authors":"Pierre Bourhis, Marco Manna, Michael Morak, Andreas Pieris","year":"2016","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Calì et al., 2004] Andrea Calì, Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. Data integration un- der integrity constraints. Inf. Syst., 29(2):147-163, 2004.","title":"Data integration under integrity constraints","authors":"Andrea Calì, Diego Calvanese, Giuseppe De, Giacomo, Maurizio Lenzerini","year":"2004","venue":"Inf. Syst","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Calì et al., 2012] Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. JWS, 2012.","title":"A general datalog-based framework for tractable query answering over ontologies","authors":"Andrea Calì, Georg Gottlob, Thomas Lukasiewicz","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Calì et al., 2013] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive relational constraints. JAIR, 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":"JAIR","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calvanese et al., 2007a] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. EQL-Lite: Effective first-order query pro- cessing in description logics. In IJCAI'07, 2007.","title":"EQL-Lite: Effective first-order query processing in description logics","authors":"Calvanese","year":"2007","venue":"IJCAI'07","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calvanese et al., 2007b] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. Tractable reasoning and efficient query an- swering in description logics: The DL-Lite family. J. Au- tom. Reasoning, 39(3):385-429, 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Calvanese et al., 2014] Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, and Mantas Simkus. Capturing relational schemas and functional dependencies in RDFS. In AAAI'11, pages 1003-1011, 2014.","title":"Capturing relational schemas and functional dependencies in RDFS","authors":"Calvanese","year":"2014","venue":"AAAI'11","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Calvanese et al., 2017] Diego Calvanese, Benjamin Cogrel, Sarah Komla-Ebri, Roman Kontchakov, Davide Lanti, Martin Rezk, Mariano Rodriguez-Muro, and Guohui Xiao. Ontop: Answering SPARQL queries over relational databases. Semantic Web, 8(3):471-487, 2017.","title":"Ontop: Answering SPARQL queries over relational databases","authors":"Calvanese","year":"2017","venue":"Semantic Web","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Console and Lenzerini, 2014] Marco Console and Maurizio Lenzerini. Data quality in ontology-based data access: The case of consistency. In AAAI'14, pages 1020-1026, 2014.","title":"Data quality in ontology-based data access: The case of consistency","authors":"Marco Console, Maurizio Lenzerini","year":"2014","venue":"AAAI'14","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Console, 2016] Marco Console. Data accuracy as knowl- edge in ontology based data access (preliminary report). In Proceedings of the 29th International Workshop on De- scription Logics, 2016.","title":"Data accuracy as knowledge in ontology based data access (preliminary report)","authors":"Marco Console","year":"2016","venue":"Proceedings of the 29th International Workshop on Description Logics","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[de Bruijn et al., 2005] Jos de Bruijn, Rubén Lara, Axel Polleres, and Dieter Fensel. OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic web. In WWW'05, pages 623-632, 2005.","title":"OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic web","authors":"De Bruijn","year":"2005","venue":"WWW'05","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Donini et al., 2002] Francesco M. Donini, Daniele Nardi, and Riccardo Rosati. Description logics of minimal knowledge and negation as failure. TOCL, 3(2), 2002.","title":"Description logics of minimal knowledge and negation as failure","authors":"Francesco M Donini, Daniele Nardi, Riccardo Rosati","year":"2002","venue":"TOCL","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fan et al., 2008] Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, and Yinghui Wu. Propagating functional dependencies with conditions. PVLDB, 1(1):391-407, 2008.","title":"Propagating functional dependencies with conditions","authors":"Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui Wu","year":"2008","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fan, 2009] Wenfei Fan. Implication of constraints. In Ling Liu and M. Tamer Özsu, editors, Encyclopedia of Database Systems, pages 1396-1400. Springer, 2009.","title":"Wenfei Fan. Implication of constraints","authors":"Fan","year":"2009","venue":"Encyclopedia of Database Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kharlamov et al., 2017] Evgeny Kharlamov, Dag Hovland, Martin G. Skjæveland, Dimitris Bilidas, Ernesto Jiménez- Ruiz, Guohui Xiao, Ahmet Soylu, Davide Lanti, Martin Rezk, Dmitriy Zheleznyakov, Martin Giese, Hallstein Lie, Yannis E. Ioannidis, Yannis Kotidis, Manolis Koubarakis, and Arild Waaler. Ontology based data access in Statoil. J. Web Sem., 44:3-36, 2017.","title":"Ontology based data access in Statoil","authors":"Evgeny Kharlamov, Dag Hovland, Martin G Skjæveland, Dimitris Bilidas, Ernesto Jiménez-Ruiz, Guohui Xiao, Ahmet Soylu, Davide Lanti, Martin Rezk, Dmitriy Zheleznyakov, Martin Giese, Hallstein Lie, Yannis E Ioannidis, Yannis Kotidis, Manolis Koubarakis, Arild Waaler","year":"2017","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Klug and Price, 1982] Anthony C. Klug and Rod Price. De- termining view dependencies using tableaux. ACM Trans. Database Syst., 7(3):361-380, 1982.","title":"Determining view dependencies using tableaux","authors":"Anthony C Klug, Rod Price","year":"1982","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Klug, 1980] Anthony C. Klug. Calculating constraints on relational expressions. TODS, 5(3):260-290, 1980.","title":"Calculating constraints on relational expressions","authors":"C Anthony, Klug","year":"1980","venue":"TODS","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lenzerini, 2002] Maurizio Lenzerini. Data integration: A theoretical perspective. In PODS'02, 2002.","title":"Data integration: A theoretical perspective","authors":"Maurizio Lenzerini","year":"2002","venue":"PODS'02","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Motik and Rosati, 2010] Boris Motik and Riccardo Rosati. Reconciling description logics and rules. J. ACM, 57(5):30:1-30:62, 2010.","title":"Reconciling description logics and rules","authors":"Rosati Motik, Boris Motik, Riccardo Rosati","year":"2010","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Motik et al., 2009] Boris Motik, Ian Horrocks, and Ulrike Sattler. Bridging the gap between OWL and relational databases. J. Web Sem., 7(2):74-89, 2009.","title":"Bridging the gap between OWL and relational databases","authors":"Boris Motik, Ian Horrocks, Ulrike Sattler","year":"2009","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Patel-Schneider and Franconi, 2012] Peter F. Patel- Schneider and Enrico Franconi. Ontology constraints in incomplete and complete data. In ISWC'12, 2012.","title":"Ontology constraints in incomplete and complete data","authors":"F Peter, Enrico Patel-Schneider, Franconi","year":"2012","venue":"ISWC'12","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Patel-Schneider, 2015] Peter F. Patel-Schneider. Using de- scription logics for RDF constraint checking and closed- world recognition. In AAAI'15, pages 247-253, 2015.","title":"Using description logics for RDF constraint checking and closedworld recognition","authors":"F Peter, Patel-Schneider","year":"2015","venue":"AAAI'15","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Pichler and Skritek, 2011] Reinhard Pichler and Sebastian Skritek. The complexity of evaluating tuple generating de- pendencies. In ICDT'11, pages 244-255, 2011.","title":"The complexity of evaluating tuple generating dependencies","authors":"Reinhard Pichler, Sebastian Skritek","year":"2011","venue":"ICDT'11","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenz- erini, and Riccardo Rosati. Linking data to ontologies. Journal on Data Semantics, 10:133-173, 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","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Sagiv, 1987] Yehoshua Sagiv. Optimizing datalog pro- grams. In PODS'87, pages 349-362, 1987.","title":"Optimizing datalog programs","authors":"Yehoshua Sagiv, Sagiv","year":"1987","venue":"PODS'","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Sequeda et al., 2012] Juan F. Sequeda, Marcelo Arenas, and Daniel P. Miranker. On directly mapping relational databases to RDF and OWL. In WWW'12, 2012.","title":"On directly mapping relational databases to RDF and OWL","authors":"Juan F Sequeda, Marcelo Arenas, Daniel P Miranker","year":"2012","venue":"WWW'12","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Shmueli, 1993] Oded Shmueli. Equivalence of DATALOG queries is undecidable. JLP, 15(3):231-241, 1993.","title":"Equivalence of DATALOG queries is undecidable","authors":"Oded Shmueli, Shmueli","year":"1993","venue":"JLP","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Tao et al., 2010] Jiao Tao, Evren Sirin, Jie Bao, and Deb- orah L. McGuinness. Integrity constraints in OWL. In AAAI'10, 2010.","title":"Integrity constraints in OWL","authors":"Jiao Tao, Evren Sirin, Jie Bao, Deborah L Mcguinness","year":"2010","venue":"AAAI'10","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}