Fuzzy Galois connections on fuzzy sets

In fairly elementary terms this paper presents how the theory of preordered fuzzy sets, more precisely quantale-valued preorders on quantale-valued fuzzy sets, is established under the guidance of enriched category theory. Motivated by several key results from the theory of quantaloid-enriched categories, this paper develops all needed ingredients purely in order-theoretic languages for the readership of fuzzy set theorists, with particular attention paid to fuzzy Galois connections between preordered fuzzy sets.Comment: 30 pages, final versio

On fuzzy reasoning schemes

In this work we provide a short survey of the most frequently used fuzzy reasoning schemes. The paper is organized as follows: in the first section we introduce the basic notations and definitions needed for fuzzy inference systems; in the second section we explain how the GMP works under Mamdani, Larsen and G¨odel implications, furthermore we discuss the properties of compositional rule of inference with several fuzzy implications; and in the third section we describe Tsukamoto’s, Sugeno’s and the simplified fuzzy inference mechanisms in multi-input-single-output fuzzy systems

Extending FuzAtAnalyzer to approach the management of classical negation

FuzAtAnalyzer was conceived as a Java framework which goes beyond of classical tools in formal concept analysis. Specifically, it successfully incorporated the management of uncertainty by means of methods and tools from the area of fuzzy formal concept analysis. One limitation of formal concept analysis is that they only consider the presence of properties in the objects (positive attributes) as much in fuzzy as in crisp case. In this paper, a first step in the incorporation of negations is presented. Our aim is the treatment of the absence of properties (negative attributes). Specifically, we extend the framework by including specific tools for mining knowledge combining crisp positive and negative attributes.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

On the existence of right adjoints for surjective mappings between fuzzy structures0

En este trabajo los autores continúan su estudio de la caracterización de la existencia de adjunciones (conexiones de Galois isótonas) cuyo codominio no está dotado de estructura en principio. En este artículo se considera el caso difuso en el que se tiene un orden difuso R definido en un conjunto A y una aplicación sobreyectiva f:A-> B compatible respecto de dos relaciones de similaridad definidas en el dominio A y en el condominio B, respectivamente. Concretamente, el problema es encontrar un orden difuso S en B y una aplicación g:B-> A compatible también con las correspondientes similaridades definidas en A y en B, de tal forma que el par (f,g) constituya un adjunción

Controlled Fuzzy Parallel Rewriting

We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show (i) regular control does not provide additional generating power to the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyper-AFFL, i.e., a hyper-algebraically closed full Abstract Family of Fuzzy Languages