Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive Datalog

18Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) that represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning. In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts. The proposed technique is shown to be worst-case optimal w.r.t. combined and data complexity. ©S. Rudolph, M. Krötzsch, and P. Hitzler.

Cite

CITATION STYLE

APA

Rudolph, S., Krötzsch, M., & Hitzler, P. (2012). Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive Datalog. Logical Methods in Computer Science, 8(1). https://doi.org/10.2168/LMCS-8(1:12)2012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free