1941 search results - page 100 / 389 » On the Hardness of Approximate Reasoning |
190
click to vote
DLOG
2011
14 years 10 months ago
2011
Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as th...
180
click to vote
ICCBR
1999
Springer
15 years 10 months ago
1999
Springer
Software programming is a complex task. To help the user with this task, we are developing a case-based reasoning tool capable of suggesting code to the programmer (software reuse...
131
click to vote
AAAI
2007
15 years 8 months ago
2007
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
159
click to vote
CIKM
1997
Springer
15 years 10 months ago
1997
Springer
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
172
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...