A general datalog-based framework for tractable query answering over ontologies

By Andrea Calì, Georg Gottlob, Thomas Lukasiewicz. Sistemi Evoluti per Basi di Dati, 2009

578 citations recorded by the source corpus.

In this paper, we introduce a family of expressive extensions of Datalog, called Datalog+/-, as a new paradigm for query answering over ontologies. The Datalog+/- family admits existentially quantified variables in rule heads, and has suitable restrictions to ensure highly efficient ontology querying. We show in particular that Datalog+/- generalizes the DL-Lite family of tractable description logics, which are the most common tractable ontology languages in the context of the Semantic Web and databases. We also show how stratified negation can be added to Datalog+/- while keeping ontology querying tractable. Furthermore, the Datalog+/- family is of interest in its own right and can, moreover, be used in various contexts such as data integration and data exchange.

Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/1b1a7c70919c767837232c1cbc630c608ec49930

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Michel Leclère
2. Jean-François Baget
3. Eric Salvat
4. Marie-Laure Mugnier

In Computer Networks and Communications

1. Michel Leclère
2. Jean-François Baget
3. Eric Salvat
4. Marie-Laure Mugnier

Citations in the corpus

• On rules with existential variables: Walking the decidability line (2011, background): “In [13] an abstract condition called separability (generalizing the non-key-conflicting notions introduced in [17] and [12]) is defined on the set T ∪ E , where T is a set of TGDs and E is a set of EGDs.”