We analyze the complexity of reasoning with circumscribed low-complexity DLs such as DL-lite and the EL family, under suitable restrictions on the use of abnormality predicates. We prove that in circumscribed DL-liteR complexity drops from NExpNP to the second level of the polynomial hierarchy. In EL, reasoning remains ExpTime-hard, in general. However, by restricting the possible occurrences of existential restrictions, we obtain membership in Σp 2 and Πp 2 for an extension of EL.

Authors

• Piero A. Bonatti
• Marco Faella
• Luigi Sauro Universita' di Napoli Federico II

Keywords

No keywords are indexed for this paper.