Cartesian Product in Description Logics
J. Malenko · 2008
We extend two description logics by introducing cartesian product (CP) of concepts and roles. In SROIQ, we show how CP axioms can be reduced using other language constructs. We present a polynomial algorithm for subsumption checking in EL++ with CP axioms. We prove that the introduction of CP does not increase the complexity of reasoning tasks in both SROIQ and EL++.