Ontology-Based Data Access
From MaRDI portal
Publication:5012511
DOI10.1145/2661643zbMath1474.68082arXiv1301.6479OpenAlexW2763521382MaRDI QIDQ5012511
Balder ten Cate, Carsten Lutz, Frank Wolter, Meghyn Bienvenu
Publication date: 25 November 2021
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.6479
Related Items (26)
Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Unnamed Item ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Unnamed Item ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Emptiness problems for distributed automata ⋮ Finite model reasoning over existential rules ⋮ Answer Counting under Guarded TGDs ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ On guarded extensions of MMSNP ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ Reasoning on anonymity in Datalog ⋮ Unnamed Item ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Unnamed Item ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Unnamed Item ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ Logical separability of labeled data examples under ontologies ⋮ Guarded Ontology-Mediated Queries ⋮ ASNP: a tame fragment of existential second-order logic ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
This page was built for publication: Ontology-Based Data Access
