Complexities of Horn description logics
From MaRDI portal
Recommendations
- Horn knowledge bases in regular description logics with PTime data complexity
- Automated Reasoning with Analytic Tableaux and Related Methods
- Description Logics
- Conservative Extensions in Horn Description Logics with Inverse Roles
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
Cited in
(13)- An efficient algorithm for Horn description
- Combining Horn rules and description logics in CARIN
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Games for query inseparability of description logic knowledge bases
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Horn knowledge bases in regular description logics with PTime data complexity
- OWL 2 profiles: an introduction to lightweight ontology languages
- scientific article; zbMATH DE number 2090546 (Why is no real title available?)
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- Model comparison games for Horn description logics
- Reasoning in OWL 2 EL with hierarchical concrete domains
- Explaining reasoning results for description logic ontologies (invited paper)
This page was built for publication: Complexities of Horn description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946686)
