Pages that link to "Item:Q3055811"
From MaRDI portal
The following pages link to Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! (Q3055811):
Displaying 8 items.
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Query answering with DBoxes is hard (Q2825409) (← links)
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases (Q2938475) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- Ontology-mediated probabilistic model checking (Q6536352) (← links)
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates (Q6566618) (← links)