Query answering under non-guarded rules in datalog+/-

  • Authors:

  • Andrea Calì;Georg Gottlob;Andreas Pieris

  • Affiliations:

  • Computing Laboratory, University of Oxford, UK;Oxford-Man Institute of Quantitative Finance, University of Oxford, UK;Department of Information Systems and Computing, Brunel University, UK

  • Venue:
  • RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
  • 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. A well-known class of tractable ontology languages is the DL-lite family; however, in DL-lite it is impossible to express simple and useful integrity constraints that involve joins. To overcome this limitation, the Datalog+/- class of decidable languages uses tuple-generating dependencies (TGDs) as rules, thus allowing for conjunctions of atoms in the rule bodies, with suitable limitations to ensure decidability. In particular, sticky sets of TGDs allow for joins and variable repetition in rule bodies under certain conditions. In this paper we extend the notion of stickiness by introducing weaklysticky sets of TGDs, which also generalize the well-known weakly-acyclic sets of TGDs. We investigate the complexity of query answering under such language, and in addition we provide novel complexity results on weakly-acyclic sets of TGDs. Moreover, we present the novel class of sticky-join sets of TGDs, which generalizes both sticky sets of TGDs and so-called linear TGDs, an extension of inclusion dependencies.