Conjunctive query answering in the description logic S H using knots
From MaRDI portal
Publication:414848
DOI10.1016/J.JCSS.2011.02.012zbMATH Open1238.68153OpenAlexW2008135441MaRDI QIDQ414848FDOQ414848
Authors: Thomas Eiter, Magdalena Ortiz, Mantas Šimkus 
Publication date: 11 May 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.02.012
Recommendations
- Query Answering in Description Logics: The Knots Approach
- Conjunctive query answering for the description logic SHIQ
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Data complexity of query answering in description logics
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
Cites Work
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Linking Data to Ontologies
- Title not available (Why is that?)
- Reasoning in description logics by a reduction to disjunctive datalog
- Computational aspects of monotone dualization: a brief survey
- Title not available (Why is that?)
- Reasoning on UML class diagrams
- FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
- Conjunctive query containment and answering under description logic constraints
- Combining Horn rules and description logics in CARIN
- The complexity of finite model reasoning in description logics
- Complexity of Planning in Action Formalisms Based on Description Logics
- Reasoning About Actions Using Description Logics with General TBoxes
- Conjunctive query answering for the description logic SHIQ
- Query Answering in Description Logics: The Knots Approach
- Using causal relationships to deal with the ramification problem in action formalisms based on description logics
- Reasoning Using Knots
- Logic for Programming, Artificial Intelligence, and Reasoning
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Data complexity of query answering in expressive description logics via tableaux
Cited In (8)
- 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
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Conjunctive query answering for the description logic SHIQ
- Reasoning and query answering in description logics
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Query Answering in Description Logics: The Knots Approach
Uses Software
This page was built for publication: Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414848)
