%0 Journal Article %J Logical Methods in Computer Science %D 2012 %T Type-Elimination-Based Reasoning for the Description Logic SHIQbs using Decision Diagrams and Disjunctive Datalog %A Sebastian Rudolph %A Markus Krötzsch %A Pascal Hitzler %K datalog %K decision diagrams %K description logics %K type elimination %X 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. %B Logical Methods in Computer Science %V 8 %G eng %U http://dx.doi.org/10.2168/LMCS-8(1:12)2012 %R 10.2168/LMCS-8(1:12)2012 %0 Conference Paper %B Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011 %D 2011 %T A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies %A Markus Krötzsch %A Frederick Maier %A Adila Krisnadhi %A Pascal Hitzler %E Sadagopan Srinivasan %E Krithi Ramamritham %E Arun Kumar %E M. P. Ravindra %E Elisa Bertino %E Ravi Kumar %K datalog %K Description Logic %K Semantic Web Rule Language %K SROIQ %K tractability %K Web Ontology Language %X We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like "variable nominal classes" within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) in their native syntax. We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROELV3(\cap, x) that is versatile enough to capture the lightweight languages OWL EL and OWL RL. %B Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011 %I ACM %P 645-654 %8 03/2011 %@ 978-1-4503-0632-4 %G eng %U http://doi.acm.org/10.1145/1963405.1963496 %R 10.1145/1963405.1963496