| Oldenburg University |
In multivalued logics over [0,1] the conjunction is usually defined as a continuous, associative, and symmetric connective satisfying (1), and the disjunction is defined as an operator implied by De Morgan‟s Laws according to the definition of conjunction. In such circumstances, the conjunction satisfies the t-norm property, and the disjunction satisfies the t-conorm property.
Notice that properties (1) and (2) lead to the conclusion that the truth-value of the conjunction is equal or less than those of its components; and the truth value of the disjunction is equal or greater than those of its components. The rejection of these properties constitutes the basics of Compensatory Fuzzy Logic (CFL). The fundamentals of CFL is that an increase or decrease of the truth value of the conjunction or disjunction, as a result of changes in the truth value of one component, can be compensated by an increase or decrease, respectively, of the truth value of other component.
This notion yields a very sensible multi-value logic that maintains the categorical values of the truth values. Also, this capacity makes CFL especially suited for selection problems; yet it is also convenient for ranking, appraising, and classificatory purposes.
| Date added: | 06/03/2010 |
| Date modified: | 06/03/2010 |
| Filesize: | 221.24 kB |
| Downloads: | 67 |
| Date added: | 06/10/2010 |
| Date modified: | 06/10/2010 |
| Filesize: | Unknown |
| Downloads: | 51 |