Min-implication fuzzy relation equations based on Booleantype implications can also be viewed as a way of implementing fuzzy associative memories with perfect recall. In this paper, fuzzy associative memories with perfect recall are constructed, and new on-line learning algorithms adapting the weights of its interconnections are incorporated into this neural network when the solution set of the...

Different models for computing the spatial relations have been developed in the last decade. Separate methods are used for computing topological, directional and distance relations. These models have also been extended in fuzzy domains based on fuzzy or vague objects and less attention has been paid to fuzzy relations. In this paper 8 fuzzy topological relations are computed with the help of 1D...

Fuzzy graphs are the backbone of many real systems like networks, image, scheduling, etc. But, due to some restriction on edges, fuzzy graphs are limited to represent for some systems. Generalized fuzzy graphs are appropriate to avoid such restrictions. In this study generalized fuzzy graphs are introduced. In this study, matrix representation of generalized fuzzy graphs is described. Completen...

In this note, we continue the works in the paper [Some properties of L-fuzzy approximation spaces on bounded integral residuated lattices", Information Sciences, 278, 110-126, 2014]. For a complete involutive residuated lattice, we show that the L-fuzzy topologies generated by a reflexive and transitive L-relation satisfy (TC)L or (TC)R axioms and the L-relations induced by two L-fuzzy topologi...

In order to obtain the information from an L-Fuzzy context, the complete relation between the objects and the attributes is needed. However, the contexts that model many situations have absent values. To solve this problem, at the beginning of the paper we remind the interval-valued linguistic variable definition and, later, we propose an extension of the fuzzy propositions to the interval-valu...

This paper presents a systematic approach to implementing fuzzy parsers. A fuzzy parser is a form of syntax analyzer that performs analysis on selected portions of its input rather than performing a detailed analysis of a complete source text. Fuzzy parsers are often components of software tools and also of program development environments that extract information from source texts. This paper ...

State reduction of fuzzy automata has been studied by many authors. All of them have dealt with classical fuzzy automata over the Gödel structure and reduction has been done using crisp equivalence relations. In [2, 3, 7] we have made several innovations. We have studied fuzzy automata over a more general structure of truth values, over a complete residuated lattice, we have shown that better r...

This paper first presents a simple explanation for the min/max bounds which are used in interval probability theory ( I n ) [l], possibility theory [2], fuzzy rough sets [4], and vague logic [ 5 ] . Based on this definition, a computable version of first-order fuzzy logic is defined, where all of the upper bounds for instances of a theorem and its negation are guaranteed to eventually be listed...