Towards richer rule languages with polynomial data complexity for the Semantic Web
2015 (English)In: Data & Knowledge Engineering, ISSN 0169-023X, Vol. 96-97, 57-77 p.Article in journal (Refereed) Published
We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-Reg(1), Horn-SHTQ and Horn-SROIQ, while still has PTime data complexity. In comparison with Horn-SROIQ, Horn-DL additionally allows the universal role and assertions of the form irreflexive(s), -s(a, b), a b. More importantly, in contrast to all the well-known Horn fragments epsilon L, DL-Lite, DLP, Horn-SHIQ, and Horn-SROIQ of description logics, Horn-DL allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. We develop the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases.
Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2015. Vol. 96-97, 57-77 p.
Description logics; Semantic Web; Rule-based languages; Horn fragments; Horn-DL
IdentifiersURN: urn:nbn:se:liu:diva-120363DOI: 10.1016/j.datak.2015.04.005ISI: 000357627200006OAI: oai:DiVA.org:liu-120363DiVA: diva2:843859