Cited in
(35)- Games for query inseparability of description logic knowledge bases
- Preserving constraints with the stable chase
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Foundations of ontology-based data access under bag semantics
- The price of query rewriting in ontology-based data access
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Complexity and expressive power of weakly well-designed SPARQL
- MiniCon
- Atelier B
- SPARQL
- nSPARQL
- Konclude
- ContentCVS
- Pronto
- LUBM
- PAGOdA
- RacerPro
- CEX
- Datalog
- DBpedia
- Graal
- NoHR
- iBench
- RDFox
- Vadalog
- MASTRO
- Polyanna
- Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna
- Logical foundations of information disclosure in ontology-based data integration
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data
- LARS
- Query answering DL-lite knowledge bases from hidden datasets
- DaRLing: a Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries
- DatalogMTL
This page was built for software: Ontop
