I. The need for comparative evaluation of performance of different systems of fuzzy connectives in soft computing applications This paper continues our work on developing new methods and tools for comparative assessment of the adequacy of diierent many-valued implication operators and other fuzzy connectives. To deal with the problem of selecting the optimal fuzzy logic connectives, new methods...

There exists infinitely many ways to extend the classical propositional connectives to the set [0, 1] such that the behavior in its extremes is as in the classical logic. Still, it is a consensus that it is not sufficient, demanding that these extensions also preserve some minimal logical properties of the classical connectives. Thus, the notions of t-norms, t-conorms, fuzzy negations, and fuzz...

In this paper we present some Boolean algebras in the form of lattice by using the fuzzy implication. We show that these methods lead to various and much richer algebraic structures on the set of all fuzzy implications than obtained in the literature. KeywordsFuzzy logic connectives, Fuzzy implication, Algebras, Lattice.

By making use of quantum parallelism, quantum processes provide parallel modelling for fuzzy connectives and the corresponding computations of quantum states can be simultaneously performed, based on the superposition of membership degrees of an element with respect to the different fuzzy sets. Such description and modelling is mainly focussed on representable fuzzy Xor connectives and their du...

Logical connectives on fuzzy sets arise from those on the unit interval. The basic theory of these connectives is cast in an algebraic spirit with an emphasis on equivalence between the various systems that arise. Special attention is given to De Morgan systems with strict Archimedean t-norms and strong negations. A typical result is that any De Morgan system with strict t-norm and strong negat...

In the last years, the adoption of active systems has increased in many fields of computer science, such as databases, sensor networks, and software engineering. These systems are able to automatically react to events, by collecting information from outside and internally generating new events. However, the collection of data is often hampered by uncertainty and vagueness that can arise from th...

A fuzzy rough set approach has been proposed without using any fuzzy logical connectives. By this approach, gradual decision rules are induced from a given decision table. Fuzzy-rough modus ponens and fuzzy-rough modus tollens have been formulated based on the gradual decision rules. The equivalence condition between fuzzy-rough modus ponens and fuzzy-rough modus tollens is discussed. The condi...

In this paper, the perturbation of fuzzy connectives and the robustness of fuzzy reasoning are investigated. This perturbation of Schweizer-Sklar parameterized t-norms and its residuated implication operators are given. We show that full implication triple I algorithms based on Schweizer-sklar operators are robust for normalized Minkowski distance.

While traditional algorithms concern positive associations between binary or quantitative attributes of databases, this paper focuses on mining both positive and negative fuzzy association rules. We show how, by a deliberate choice of fuzzy logic connectives, significantly increased expressivity is available at little extra cost. In particular, rule quality measures for negative rules can be co...