Reasoning in description logics by a reduction to disjunctive datalog

DOI10.1007/s10817-007-9080-3zbMath1132.68735OpenAlexW2107910552MaRDI QIDQ2462648

Ulrike Sattler, Boris Motik, Ullrich Hustadt

Publication date: 3 December 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-007-9080-3

zbMATH Keywords

Description logicsData complexityDisjunctive datalog

Mathematics Subject Classification ID

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

Related Items (16)

Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Unnamed Item ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Data-complexity of the two-variable fragment with counting quantifiers ⋮ View-based query answering in description logics: semantics and complexity ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Reasoning with Uncertain and Inconsistent OWL Ontologies ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ The role of semantics in mining frequent patterns from knowledge bases in description logics with rules ⋮ Magic sets for disjunctive Datalog programs ⋮ PEER-TO-PEER REASONING FOR INTERLINKED ONTOLOGIES ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Maintenance of datalog materialisations revisited ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies

Uses Software

• Pellet
• FaCT++
• Racer
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data complexity of query answering in description logics
• A structure-preserving clause form translation
• Theorem proving with ordering and equality constrained clauses
• Basic paramodulation
• PSPACE Reasoning for Graded Modal Logics
• On the power of magic
• A Resolution-Based Decision Procedure for $\mathcal{SHOIQ}$
• Practical reasoning for very expressive description logics
• Term Rewriting and All That
• Automated Reasoning
• Logic Programming
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• Logic Programming and Nonmonotonic Reasoning
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Reasoning in description logics by a reduction to disjunctive datalog