Pages that link to "Item:Q2946686"

The following pages link to Complexities of Horn Description Logics (Q2946686):

Displaying 6 items.

• Games for query inseparability of description logic knowledge bases (Q253977) (← links)
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833) (← links)
• Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
• OWL 2 Profiles: An Introduction to Lightweight Ontology Languages (Q4647815) (← links)
• Efficient TBox Reasoning with Value Restrictions using the <i>wer</i> Reasoner (Q6063879) (← links)