The following pages link to Ontop (Q34717):
Displaying 13 items.
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- Complexity and expressive power of weakly well-designed SPARQL (Q1650913) (← links)
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data (Q1678449) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- Query answering DL-lite knowledge bases from hidden datasets (Q2035633) (← links)
- Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna (Q2185474) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Foundations of ontology-based data access under bag semantics (Q2321309) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Preserving Constraints with the Stable Chase (Q3305357) (← links)
- DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries (Q5140027) (← links)
