Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results

On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually produce undecidable formalisms, unless constrained in a specific way. We look at one of the most expressive - but decidable - such formalisms proposed: DL-safe rules, and present a tableaux-based algorithm for query answering in OWL-DL augmented with a DL-safe rules component. In this paper we present our algorithm which is an extension of the SHOIQ tableaux algorithm and show the preliminary empirical results. Knowing that we pay a high price in performance for this expressivity, we also explore possible optimizations.

• Type: Conference
• Year: 2006
• Where: DLOG
• Authors: Vladimir Kolovski, Bijan Parsia, Evren Sirin
• Keywords: Automated Reasoning, DL-safe Rules, DLOG 2006, Ruleslike Expressivity, Undecidable Formalisms