Datalog+/-: a family of languages for ontology querying

  • Authors:

  • Andrea Calì;Georg Gottlob;Thomas Lukasiewicz;Andreas Pieris

  • Affiliations:

  • Department of Computer Science, University of London, Birkbeck College, UK;Computing Laboratory, University of Oxford, UK;Computing Laboratory, University of Oxford, UK;Computing Laboratory, University of Oxford, UK

  • Venue:
  • Datalog'10 Proceedings of the First international conference on Datalog Reloaded
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In ontology-based data access, an extensional database is enhanced by an ontology that generates new intensional knowledge which has to be considered when answering queries. In this setting, tractable data complexity (i.e., complexity w.r.t. the data only) of query answering is crucial, given the need to deal with large data sets. This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying. Plain Datalog is extended by allowing existential quantifiers, the equality predicate, and the truth constant false to appear in rule heads. At the same time, the resulting language is syntactically restricted, so as to achieve decidability and even tractability.