Conjunctive query answering for the description logic SHIQ
From MaRDI portal
Publication:3624113
zbMATH Open1183.68244arXiv1111.0049MaRDI QIDQ3624113FDOQ3624113
Authors:
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1111.0049
Recommendations
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Data complexity of query answering in description logics
- Data complexity of query answering in expressive description logics via tableaux
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Cited In (33)
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Optimized query rewriting for OWL 2 QL
- On the relation between SPARQL1.1 and Answer Set Programming
- Data-complexity of the two-variable fragment with counting quantifiers
- Title not available (Why is that?)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- The Complexity of Conjunctive Query Answering in Expressive 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
- Cheap Boolean Role Constructors for Description Logics
- Formal Properties of Modularisation
- Description Logics
- Modal definability of first-order formulas with free variables and query answering
- Decidability of SHIQ with complex role inclusion axioms
- Inseparability and conservative extensions of description logic ontologies: a survey
- Data complexity of query answering in expressive description logics via tableaux
- Hybrid logics and ontology languages
- \({\mathcal E}\)-connections of abstract description systems
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Query answering with DBoxes is hard
- Combining answer set programming with description logics for the semantic web
- Reasoning and query answering in description logics
- Role Conjunctions in Expressive Description Logics
- Exploiting conjunctive queries in description logic programs
- Foundations of Onto-Relational Learning
- Answering regular path queries in expressive description logics via alternating tree-automata
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- On the scalability of description logic instance retrieval
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- Query Answering in Description Logics: The Knots Approach
- Absorption for ABoxes
Uses Software
This page was built for publication: Conjunctive query answering for the description logic SHIQ
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624113)
