Pages that link to "Item:Q2462648"

The following pages link to Reasoning in description logics by a reduction to disjunctive datalog (Q2462648):

Displaying 16 items.

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