The Complexity of Conjunctive Query Answering in Expressive Description Logics
From MaRDI portal
Recommendations
- Conjunctive query answering for the description logic SHIQ
- Data complexity of query answering in expressive description logics via tableaux
- Data complexity of query answering in description logics
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
Cites work
- scientific article; zbMATH DE number 1614719 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1405450 (Why is no real title available?)
- scientific article; zbMATH DE number 2243392 (Why is no real title available?)
- Alternation
- Conjunctive query answering for the description logic SHIQ
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
Cited in
(41)- Absorption for ABoxes
- Query answering in circumscribed OWL2 profiles
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Towards efficient reasoning under guarded-based disjunctive existential rules
- Guarded-based disjunctive tuple-generating dependencies
- scientific article; zbMATH DE number 2080464 (Why is no real title available?)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- Data complexity of query answering in description logics
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- View-based query answering in description logics: semantics and complexity
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Description Logics
- Modal definability of first-order formulas with free variables and query answering
- How hard is completeness reasoning for conjunctive queries?
- Data complexity of query answering in expressive description logics via tableaux
- On combining ontologies and rules
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- scientific article; zbMATH DE number 1424042 (Why is no real title available?)
- Complexities of Horn description logics
- Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
- Querying the unary negation fragment with regular path expressions
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Conjunctive query answering for the description logic SHIQ
- Query answering with DBoxes is hard
- Reasoning and query answering in description logics
- Role Conjunctions in Expressive Description Logics
- Combined-semantics equivalence of conjunctive queries: decidability and tractability results
- Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
- Answering regular path queries in expressive description logics via alternating tree-automata
- The complexity of finite model reasoning in description logics
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- Regular path queries in lightweight description logics: complexity and algorithms
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- Satisfiability and query answering in description logics with global and local cardinality constraints
- Horn knowledge bases in regular description logics with PTime data complexity
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Query Answering in Description Logics: The Knots Approach
- The complexity of reverse engineering problems for conjunctive queries
- Logical separability of labeled data examples under ontologies
This page was built for publication: The Complexity of Conjunctive Query Answering in Expressive Description Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541701)
