Query Answering in Description Logics: The Knots Approach
From MaRDI portal
Recommendations
Cites work
- A guide to completeness and complexity for modal logics of knowledge and belief
- BDD-based decision procedures for the modal logic K ★
- Conjunctive query answering for the description logic SHIQ
- Data complexity of query answering in expressive description logics via tableaux
- Data-complexity of the two-variable fragment with counting quantifiers
- Logic for Programming, Artificial Intelligence, and Reasoning
- Modal logic
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Reasoning Using Knots
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- The complexity of finite model reasoning in description logics
Cited in
(7)- Answering regular path queries in expressive description logics via alternating tree-automata
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- On the relation between SPARQL1.1 and Answer Set Programming
- Reasoning and query answering in description logics
- Semantic DMN: formalizing and reasoning about decisions in the presence of background knowledge
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
This page was built for publication: Query Answering in Description Logics: The Knots Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638272)