Query and Predicate Emptiness in Ontology-Based Data Access

Baader, Franz, Bienvenu, Meghyn, Lutz, Carsten and Wolter, Frank ORCID: 0000-0002-4470-606X (2016) Query and Predicate Emptiness in Ontology-Based Data Access. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 56. pp. 1-59. ISSN 1076-9757, 1943-5037

Text jair2015.pdf - Author Accepted Manuscript Download (526kB)

Abstract

<jats:p>In ontology-based data access (OBDA), database querying is enriched with an ontology that provides domain knowledge and additional vocabulary for query formulation. We identify query emptiness and predicate emptiness as two central reasoning services in this context. Query emptiness asks whether a given query has an empty answer over all databases formulated in a given vocabulary. Predicate emptiness is defined analogously, but quantifies universally over all queries that contain a given predicate. In this paper, we determine the computational complexity of query emptiness and predicate emptiness in the EL, DL-Lite, and ALC-families of description logics, investigate the connection to ontology modules, and perform a practical case study to evaluate the new reasoning services.</jats:p>

Item Type:	Article
Uncontrolled Keywords:	4605 Data Management and Data Science, 46 Information and Computing Sciences, 4609 Information Systems, 4602 Artificial Intelligence
Depositing User:	Symplectic Admin
Date Deposited:	07 Jul 2016 10:25
Last Modified:	07 Dec 2024 20:56
DOI:	10.1613/jair.4866
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3002145