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

22Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Calì, A., Gottlob, G., Lukasiewicz, T., & Pieris, A. (2011). Datalog+/-: A family of languages for ontology querying. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6702 LNCS, pp. 351–368). https://doi.org/10.1007/978-3-642-24206-9_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free