Sciweavers

88
Voted
DLOG
2003
15 years 5 days ago
Complexity of Reasoning
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
Francesco M. Donini