Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP

Authors:
Meghyn Bienvenu;Balder ten Cate;Carsten Lutz;Frank Wolter
Affiliations:
CNRS and Universite Paris Sud, Paris, France;University of California at Santa Cruz, Santa Cruz, CA, USA;University of Bremen, Bremen, Germany;University of Liverpool, Liverpool, United Kingdom
Venue:
Proceedings of the 32nd symposium on Principles of database systems
Year:
2013

Citing 25
Cited 3

Disjunctive datalog

ACM Transactions on Database Systems (TODS)
On the decidability of query containment under constraints

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Modal logic

Modal logic
Datalog LITE: a deductive query language with linear time model checking

ACM Transactions on Computational Logic (TOCL)
Dichotomies for classes of homomorphism problems involving unary functions

Theoretical Computer Science
On Digraph Coloring Problems and Treewidth Duality

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Reasoning in Description Logics by a Reduction to Disjunctive Datalog

Journal of Automated Reasoning
Constraint Satisfaction, Logic and Forbidden Patterns

SIAM Journal on Computing
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures

European Journal of Combinatorics
Forbidden lifts (NP and CSP for combinatorialists)

European Journal of Combinatorics
Homomorphism preservation theorems

Journal of the ACM (JACM)
Models of program logics

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
A general datalog-based framework for tractable query answering over ontologies

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint Satisfaction Problems of Bounded Width

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Data complexity in the ƐL family of description logics

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Linking data to ontologies

Journal on data semantics X
On the CSP dichotomy conjecture

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Characterizing schema mappings via data examples

ACM Transactions on Database Systems (TODS)
Walking the complexity lines for generalized guarded existential rules

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
On the Complexity of MMSNP

SIAM Journal on Discrete Mathematics
Queries with guarded negation

Proceedings of the VLDB Endowment
Exponential lower bounds and separation for query rewriting

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Towards more expressive ontology languages: The query answering problem

Artificial Intelligence

Ontology-based data access with databases: a short course

RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
First-order rewritability of atomic queries in horn description logics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing datalog rewritings beyond horn ontologies

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ontology-based data access is concerned with querying incomplete data sources in the presence of domain-specific knowledge provided by an ontology. A central notion in this setting is that of an ontology-mediated query, which is a database query coupled with an ontology. In this paper, we study several classes of ontology-mediated queries, where the database queries are given as some form of conjunctive query and the ontologies are formulated in description logics or other relevant fragments of first-order logic, such as the guarded fragment and the unary-negation fragment. The contributions of the paper are three-fold. First, we characterize the expressive power of ontology-mediated queries in terms of fragments of disjunctive datalog. Second, we establish intimate connections between ontology-mediated queries and constraint satisfaction problems (CSPs) and their logical generalization, MMSNP formulas. Third, we exploit these connections to obtain new results regarding (i) first-order rewritability and datalog-rewritability of ontology-mediated queries, (ii) P/NP dichotomies for ontology-mediated queries, and (iii) the query containment problem for ontology-mediated queries.