47 search results - page 4 / 10 » On approximate reasoning with graded rules |
VLDB
2001
ACM
14 years 10 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
LPNMR
2011
Springer
13 years 19 days ago
2011
Springer
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
FUZZIEEE
2007
IEEE
14 years 4 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
PLDI
2012
ACM
12 years 7 days ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
NIPS
2004
13 years 11 months ago
2004
Areas of the brain involved in various forms of memory exhibit patterns of neural activity quite unlike those in canonical computational models. We show how to use well-founded Ba...