{"type":"ScholarlyArticle","title":"Expressive Completeness of Existential Rule Languages for Ontology-Based Query Answering","authors":[{"name":"Heng Zhang","slug":"heng-zhang","given":"Heng","family":"Zhang","affiliation":""},{"name":"Yan Zhang","slug":"yan-zhang","given":"Yan","family":"Zhang","affiliation":""},{"name":"Jia-Huai You","slug":"jia-huai-you","given":"Jia-Huai","family":"You","affiliation":""}],"abstract":"Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA). Our expressive completeness result does not rely on any built-in linear order on the database. To establish the expressive completeness, we introduce a novel semantic definition for OCQA ontologies. We also show that neither the class of disjunctive tuple-generating dependencies nor the class of embedded dependencies is expressively complete for recursively enumerable OCQA ontologies.","doi":null,"url":"https://ijcai.org/proceedings/2016/192","pdf":"https://ijcai.org/proceedings/2016/0192.pdf","markdown":"https://ijcai.org/proceedings/2016/192.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/192","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":192,"pages":{"first":1330,"last":1336},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}