47 search results - page 2 / 10 » On approximate reasoning with graded rules |
AAAI
2010
13 years 6 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
FUIN
2002
13 years 5 months ago
2002
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
IJAR
2008
13 years 5 months ago
2008
The two most important models of inferencing in approximate reasoning with fuzzy sets are Zadeh's Compositional Rule of Inference (CRI) and Similarity Based Reasoning (SBR). ...
DAGSTUHL
1990
13 years 6 months ago
1990
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
ICCS
2001
Springer
13 years 9 months ago
2001
Springer
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...