Complexities of Horn Description Logics

DOI10.1145/2422085.2422087zbMath1353.68268OpenAlexW2064593774WikidataQ54824456 ScholiaQ54824456MaRDI QIDQ2946686

Sebastian Rudolph, Pascal Hitzler, Markus Krötzsch

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2422085.2422087

zbMATH Keywords

computational complexitydescription logicsHorn logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (6)

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

This page was built for publication: Complexities of Horn Description Logics