Ontological Query Answering with Existential Rules

Marie-Laure Mugnier 1
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We focus in this paper on the ontological query answering problem, which consists of querying data while taking ontological knowledge into account. To tackle this problem, we consider a logical framework based on existential rules, also called Tuple-Generating Dependencies or Datalog+/- rules. This framework can also be defined in graph terms. Query entailment with existential rules is not decidable, thus a crucial issue is to define decidable classes of rules as large as possible. This paper is a survey of decidable classes of rules, including a review of the main complexity results. It mostly relies on previous work presented at IJCAI'2009 [BLMS09] and KR'2010 [BLM10] (and developed in a journal paper [BLMS11]), updated to include very recent results.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00618296
Contributor : Marie-Laure Mugnier <>
Submitted on : Thursday, September 1, 2011 - 1:35:13 PM
Last modification on : Wednesday, December 12, 2018 - 2:38:02 PM
Long-term archiving on : Friday, December 2, 2011 - 2:31:59 AM

File

RR2011-keynote.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Marie-Laure Mugnier. Ontological Query Answering with Existential Rules. RR: Web Reasoning and Rule Systems, Aug 2011, Galway, Ireland. pp.2-23, ⟨10.1007/978-3-642-23580-1_2⟩. ⟨lirmm-00618296⟩

Share

Metrics

Record views

464

Files downloads

857