Abstract
We propose a novel method for reasoning in the description logic . After a satisfiability preserving transformation from to the description logic , the obtained Tbox is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for . This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Rudolph, S., Krötzsch, M., & Hitzler, P. (2008). Description logic reasoning with decision diagrams compiling SHIQ to disjunctive datalog. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5318 LNCS, pp. 435–450). Springer Verlag. https://doi.org/10.1007/978-3-540-88564-1_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
