Conjunctive query answering in the description logic S H using knots

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

zbMATH Keywords

computational complexityknotsdescription logicsdisjunctive Datalogconjunctive query answering

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

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

• scientific article; zbMATH DE number 67503 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• Combining Horn rules and description logics in CARIN
• Complexity of Planning in Action Formalisms Based on Description Logics
• Computational aspects of monotone dualization: a brief survey
• Conjunctive query answering for the description logic SHIQ
• Conjunctive query containment and answering under description logic constraints
• Data complexity of query answering in expressive description logics via tableaux
• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Linking Data to Ontologies
• Logic for Programming, Artificial Intelligence, and Reasoning
• Query Answering in Description Logics: The Knots Approach
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• Reasoning About Actions Using Description Logics with General TBoxes
• Reasoning Using Knots
• Reasoning in description logics by a reduction to disjunctive datalog
• Reasoning on UML class diagrams
• The complexity of finite model reasoning in description logics
• Using causal relationships to deal with the ramification problem in action formalisms based on description logics

Cited in

(8)

• Reasoning and query answering in description logics
• Conjunctive query answering for the description logic SHIQ
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• Query Answering in Description Logics: The Knots Approach
• How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• The Complexity of Conjunctive Query Answering in Expressive Description Logics

Describes a project that uses

Uses Software

• Datalog

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)