1941 search results - page 155 / 389 » On the Hardness of Approximate Reasoning |
162
click to vote
ILP
2001
Springer
15 years 11 months ago
2001
Springer
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...
148
click to vote
AUSAI
1999
Springer
15 years 10 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
166
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present an approach to hybrid semantic Web service matching that complements logic based reasoning with approximate matching based on syntactic IR based similarity computations...
142
click to vote
GIS
2010
ACM
15 years 5 months ago
2010
ACM
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
295
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...