Calì, Andrea and Gottlob, G. and Lukasiewicz, T. and Pieris, A. (2011) Datalog+/-: a family of languages for ontology querying. In: de Moor, O. and Gottlob, G. and Furche, T. and Sellers, A. (eds.) Datalog Reloaded. Lecture Notes in Computer Science 6702. London, UK: Springer, pp. 351-368. ISBN 9783642242069.
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Sarah Hall |
| Date Deposited: | 09 May 2013 16:32 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/6674 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
