Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
From MaRDI portal
Publication:414848
DOI10.1016/j.jcss.2011.02.012zbMath1238.68153MaRDI QIDQ414848
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
computational complexity; knots; description logics; disjunctive Datalog; conjunctive query answering
Related Items
Reasoning and Query Answering in Description Logics, The Complexity of Conjunctive Query Answering in Expressive Description Logics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Computational aspects of monotone dualization: a brief survey
- Data complexity of query answering in expressive description logics via tableaux
- Combining Horn rules and description logics in CARIN
- Reasoning on UML class diagrams
- Reasoning in description logics by a reduction to disjunctive datalog
- The complexity of finite model reasoning in description logics
- FDNC
- Complexity of Planning in Action Formalisms Based on Description Logics
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Reasoning About Actions Using Description Logics with General TBoxes
- Query Answering in Description Logics: The Knots Approach
- Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics
- Conjunctive query containment and answering under description logic constraints
- Linking Data to Ontologies
- Reasoning Using Knots
- Logic for Programming, Artificial Intelligence, and Reasoning
