1941 search results - page 23 / 389 » On the Hardness of Approximate Reasoning |
143
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
111
click to vote
CSL
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
113
click to vote
DLOG
2010
14 years 9 months ago
2010
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
JANCL
2002
14 years 11 months ago
2002
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
ICCBR
2009
Springer
15 years 6 months ago
2009
Springer
This paper presents a new approach for spatial event prediction that combines a value function approximation algorithm and case-based reasoning predictors. Each of these predictors...