Conjunctive query answering for the description logic SHIQ
From MaRDI portal
(Redirected from Publication:3624113)
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
(35)- Exploiting conjunctive queries in description logic programs
- On the scalability of description logic instance retrieval
- Answering regular path queries in expressive description logics via alternating tree-automata
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Absorption for ABoxes
- Data-complexity of the two-variable fragment with counting quantifiers
- Combining answer set programming with description logics for the semantic web
- Modal definability of first-order formulas with free variables and query answering
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- scientific article; zbMATH DE number 1614719 (Why is no real title available?)
- Query answering with DBoxes is hard
- Hybrid logics and ontology languages
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Inseparability and conservative extensions of description logic ontologies: a survey
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Cheap Boolean Role Constructors for Description Logics
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Foundations of Onto-Relational Learning
- Formal Properties of Modularisation
- Query Answering in Description Logics: The Knots Approach
- Description Logics
- View-based query answering in description logics: semantics and complexity
- 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
- Optimized query rewriting for OWL 2 QL
- Role Conjunctions in Expressive Description Logics
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- Query answering in lattice-based description logic
- Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
- \({\mathcal E}\)-connections of abstract description systems
- Decidability of SHIQ with complex role inclusion axioms
- Data complexity of query answering in expressive description logics via tableaux
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)
