In this paper, we derive new neuro-fuzzy structures called flexible neuro-fuzzy inference systems or FLEXNFIS. Based on the input-output data, we learn not only the parameters of the membership functions but also the type of the systems (Mamdani or logical). Moreover, we introduce: 1) softness to fuzzy implication operators, to aggregation of rules and to connectives of antecedents; 2) certaint...

In this chapter, we present a tutorial about fuzzy answer set programming (FASP); we give a gentle introduction to its basic ideas and definitions. FASP is a combination of answer set programming and fuzzy logics which has recently been proposed. From the answer set semantics, FASP inherits the declarative nonmonotonic reasoning capabilities, while fuzzy logic adds the power to model continuous...

The main contribution of this paper is to introduce an autonomous definition of the connective “fuzzy exclusive or” (fuzzy Xor, for short), which is independent from others connectives. Also, two canonical definitions of the connective Xor are obtained from the composition of fuzzy connectives, and based on the commutative and associative properties related to the notions of triangular norms, t...

AbsikactFuzzy 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 s...

This paper deals with some dependencies between fuzzy conjunctions and fuzzy implications. More precisely, a fuzzy implication generated from a fuzzy conjunction and a fuzzy conjunction induced by a fuzzy implication is considered. In the case of a fuzzy conjunction only border conditions and monotonicity are assumed. The results are illustrated by examples of weak fuzzy connectives.

The generalization of two-valued (crisp) sets to fuzzy sets gave us a rich and powerful representation scheme within the domain of semantic uncertainty. A parallel generalization of conjunctions and disjunction is needed from tnorms and t-conorms to what we might appropriately call linguistic (fuzzy) connectives, “AND," “OR," etc. In fact a closer look at the canonical forms of the combination ...

Genetic algorithms are adaptive methods which may be used as approximation heuristic for search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is the premature convergence, a premature stagnation of the search caused by the lack of diversity in...

It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbert style. Moreover, it is proven that any truth-functional semantics whose connectives are interpreted in [0,1] by continuous functions is axiomatizable by a fuzzy deduction system (but not by an effective fuzzy deduction syste...