Expressive Tractable Description Logics based on SROIQ Rules

We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ – the basis for the ongoing standardisation of OWL 2 – can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ is highly intractable, it turns out that DL rules can be introduced to various lightweight DLs without increasing their worst-case complexity. In particular, DL rules enable us to significantly extend the tractable DLs EL and DLP.

[1]  Ian Horrocks,et al.  A proposal for an owl rules language , 2004, WWW '04.

[2]  Alon Y. Halevy,et al.  Combining Horn Rules and Description Logics in CARIN , 1998, Artif. Intell..

[3]  Diego Calvanese,et al.  The description logic handbook: theory , 2003 .

[4]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[5]  Sebastian Rudolph,et al.  Complexity Boundaries for Horn Description Logics , 2007, AAAI.

[6]  Boris Motik,et al.  Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[7]  Raphael Volz,et al.  Web ontology reasoning with logic databases , 2004 .

[8]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[9]  Sebastian Rudolph,et al.  ELP: Tractable Rules for OWL 2 , 2008, SEMWEB.

[10]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[11]  Volker Haarslev,et al.  Rewriting Rules into SROIQ Axioms , 2008, Description Logics.

[12]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

[13]  Sebastian Rudolph,et al.  All Elephants are Bigger than All Mice , 2008, Description Logics.

[14]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[15]  Ian Horrocks,et al.  The Even More Irresistible $\mathcal{SROIQ}$ , 2006 .