[DL] satisfiability vs. unsatisfiability

[longo at dmi.unict.it]

Theorem 3.27 of the Description Logics Handbook says that in the dl AL  
the UN-satisfiability of a concept w.r.t. a finite set of inclusions  
is ExpTime hard. Do this result extends to the satisfiability (of a  
concept ...) in ALC?

Thank you in advance,
Cristiano Longo

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.