The price of query rewriting in ontology-based data access
From MaRDI portal
Publication:2453744
Recommendations
Cites work
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Boolean function complexity. Advances and frontiers.
- Computational Complexity
- Conjunctive query containment revisited
- Eliminating definitions and Skolem functions in first-order logic
- Exponential lower bounds and separation for query rewriting
- Fast parallel matrix and GCD computations
- Homomorphism preservation theorems
- Linking Data to Ontologies
- Logical Description of Monotone NP Problems
- Monotone circuits for matching require linear depth
- On rules with existential variables: walking the decidability line
- On the succinctness of query rewriting over shallow ontologies
- Optimized query rewriting for OWL 2 QL
- Parametrized complexity theory.
- The DL-Lite Family and Relations
- The monotone circuit complexity of Boolean functions
- Towards more expressive ontology languages: the query answering problem
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- When is the evaluation of conjunctive queries tractable?
Cited in
(24)- Foundations of ontology-based data access under bag semantics
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
- Circuit complexity meets ontology-based data access
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Controlled query evaluation in description logics through consistent query answering
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Reasoning with ontologies
- Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
- A tetrachotomy of ontology-mediated queries with a covering axiom
- On the succinctness of query rewriting over shallow ontologies
- Logical foundations of information disclosure in ontology-based data integration
- Exponential lower bounds and separation for query rewriting
- Loop restricted existential rules and first-order rewritability for query answering
- Tree-like queries in OWL 2 QL: succinctness and complexity results
- Query Rewriting and Optimization for Ontological Databases
- Exact query reformulation with first-order ontologies and databases
- Rewriting guarded existential rules into small Datalog programs
- Bounds in ontology-based data access via circuit complexity
- Reasoning on anonymity in Datalog
- Polynomial combined first-order rewritings for linear and guarded existential rules
- Preference-based inconsistency-tolerant query answering under existential rules
- Logic, languages, and rules for web data extraction and reasoning over data
- Finite model reasoning over existential rules
This page was built for publication: The price of query rewriting in ontology-based data access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453744)
