Pieris, Andreas

We consider the well-known setting of ontology-based query answering.In real-life applications, involving large amount of data, it is possiblethat the data are inconsistent with the ontology. Since standard ontologylanguages adhere to the classical first-order logic semantics, inconsistenciesare nothing else than logical contradictions. Therefore, the classicalinference semantics fails terribly when faced an inconsistency, since everythingis inferred from a contradiction. Querying inconsistent knowledge bases is an intriguing new problem that gave rise to a flourishing research activity in the KR community. In this talk, we focus on rule-based ontology languages, and we demonstrate the tight connection between classical and consistent query answering. More precisely, we focus on the standard inconsistency-tolerant semantics, namely, the ABox repair (AR) semantics, and we establish generic complexity results that allow us to obtain in a uniform way a relatively complete picture of the complexity of our problem. We also discuss sound approximations of the AR semantics, with the aim of achieving tractability of consistent query answering in data complexit

Edinburgh Research Explorer

     Edinburgh Research Explorer                                      From Classical to Consistent Query Answering under ExistentialRulesCitation for published version:Pieris, A 2015, From Classical to Consistent Query Answering under Existential Rules. in Proceedings ofthe Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-located with the 24thInternational Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires, Argentina, July 25-27,2015.. CEUR Workshop Proceedings (CEUR-WS.org).Link:Link to publication record in Edinburgh Research ExplorerDocument Version:Publisher's PDF, also known as Version of recordPublished In:Proceedings of the Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-locatedwith the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires, Argentina, July25-27, 2015.General rightsCopyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s)and / or other copyright owners and it is a condition of accessing these publications that users recognise andabide by the legal requirements associated with these rights.Take down policyThe University of Edinburgh has made every reasonable effort to ensure that Edinburgh Research Explorercontent complies with UK legislation. If you believe that the public display of this file breaches copyright pleasecontact openaccess@ed.ac.uk providing details, and we will remove access to the work immediately andinvestigate your claim.Download date: 05. Apr. 2019From Classical to Consistent Query Answeringunder Existential RulesAndreas Pieris.Institute of Information Systems,Vienna University of Technology.AbstractWe consider the well-known setting of ontology-based query answer-ing. In real-life applications, involving large amount of data, it is possiblethat the data are inconsistent with the ontology. Since standard ontologylanguages adhere to the classical first-order logic semantics, inconsisten-cies are nothing else than logical contradictions. Therefore, the classicalinference semantics fails terribly when faced an inconsistency, since every-thing is inferred from a contradiction. Querying inconsistent knowledgebases is an intriguing new problem that gave rise to a flourishing researchactivity in the KR community. In this talk, we focus on rule-based ontol-ogy languages, and we demonstrate the tight connection between classicaland consistent query answering. More precisely, we focus on the standardinconsistency-tolerant semantics, namely, the ABox repair (AR) seman-tics, and we establish generic complexity results that allow us to obtainin a uniform way a relatively complete picture of the complexity of ourproblem. We also discuss sound approximations of the AR semantics,with the aim of achieving tractability of consistent query answering indata complexity.1

From Classical to Consistent Query Answering under Existential Rules

https://www.pure.ed.ac.uk/ws/files/28083139/JOWO_15_ontolp_paper_2.pdf

From Classical to Consistent Query Answering under Existential Rules

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer