2214 search results - page 3 / 443 » Complexity of Reasoning |
82
Voted
DLOG
2003
14 years 10 months ago
2003
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...
CADE
2005
Springer
15 years 9 months ago
2005
Springer
ICLP
1994
Springer
15 years 1 months ago
1994
Springer
ICLP
1992
Springer
15 years 1 months ago
1992
Springer
AAAI
1990
14 years 10 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...