Absikact-Fuzzy connectives use to be assumed associative. In this way, key operational difficulties are solved by means of a single binary operator. In this paper we point out that the main property in order to assure operativeness should be recurszveness, which is weaker than associativity. If calculus can be obtained by means of a recursive application of a sequence of binary connectives, we still can develop operative models. It is then clearly seen that a fuzzy rule should be always understood as a family of fuzzy connectives
In this work we provide a short survey of the most frequently used fuzzy reasoning schemes. The pap...
Aggregation of information represented by membership functions is a central matter in intelligent sy...
peer reviewedThe well-known equation of associativity for binary operations may be naturally general...
The main aim of this paper is to point out that a connective rule should be understood as a consiste...
How is fuzzy logic usually formalized? There are many seemingly reasonable requirements that a logic...
As pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upo...
How is fuzzy logic usually formalized? There are many seemingly reasonable requirements that a logic...
Several authors have introduced global aggregation operators as families of aggregation operators fT...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
Connectives are usually assumed associative. Associativity allows recursive applica-tion of the same...
summary:In the paper the problem of mathematical properties of $B$-operations and weak $W\!B$-operat...
Introduces an alternative characterization of OWA operators by means of recursive definitions on the...
summary:It has been lately made very clear that aggregation processes can not be based upon a unique...
summary:We consider aggregations of fuzzy relations using means in [0,1] (especially: minimum, maxim...
AbstractProcessing information in fuzzy rule-based systems generally employs one of two patterns of ...
In this work we provide a short survey of the most frequently used fuzzy reasoning schemes. The pap...
Aggregation of information represented by membership functions is a central matter in intelligent sy...
peer reviewedThe well-known equation of associativity for binary operations may be naturally general...
The main aim of this paper is to point out that a connective rule should be understood as a consiste...
How is fuzzy logic usually formalized? There are many seemingly reasonable requirements that a logic...
As pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upo...
How is fuzzy logic usually formalized? There are many seemingly reasonable requirements that a logic...
Several authors have introduced global aggregation operators as families of aggregation operators fT...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
Connectives are usually assumed associative. Associativity allows recursive applica-tion of the same...
summary:In the paper the problem of mathematical properties of $B$-operations and weak $W\!B$-operat...
Introduces an alternative characterization of OWA operators by means of recursive definitions on the...
summary:It has been lately made very clear that aggregation processes can not be based upon a unique...
summary:We consider aggregations of fuzzy relations using means in [0,1] (especially: minimum, maxim...
AbstractProcessing information in fuzzy rule-based systems generally employs one of two patterns of ...
In this work we provide a short survey of the most frequently used fuzzy reasoning schemes. The pap...
Aggregation of information represented by membership functions is a central matter in intelligent sy...
peer reviewedThe well-known equation of associativity for binary operations may be naturally general...