The following pages link to (Q2723446):
Displaying 18 items.
- Tractable approximate deduction for OWL (Q274420) (← links)
- View-based query answering in description logics: semantics and complexity (Q414845) (← links)
- Decidability of SHIQ with complex role inclusion axioms (Q814639) (← links)
- A resolution-based decision procedure for \({\mathcal{SHOIQ}}\). (Q928657) (← links)
- Data complexity of query answering in expressive description logics via tableaux (Q945056) (← links)
- On the scalability of description logic instance retrieval (Q1040773) (← links)
- Fuzzy description logics with general t-norms and datatypes (Q1043321) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Reasoning with nominal schemas through absorption (Q2352498) (← links)
- Optimizing terminological reasoning for expressive description logics (Q2462645) (← links)
- A tableau decision procedure for \(\mathcal{SHOIQ}\) (Q2462647) (← links)
- Checking content consistency of integrated web documents (Q2508393) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- Hybrid logics and ontology languages (Q2867944) (← links)
- The Complexity of Conjunctive Query Answering in Expressive Description Logics (Q3541701) (← links)
- Composing Modular Ontologies with Distributed Description Logics (Q3631365) (← links)
- Towards a Rational Closure for Expressive Description Logics: the Case of 𝒮𝒽𝒾𝓆 (Q4637881) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
