and Applied Analysis 3 3. Main Results Throughout this paper, we will consider lattices as complete lattices,X will denote space, and μ is a membership function of any fuzzy set X. Definition 3.1. If m : σ L → R ∪ {∞} satisfies the following properties, then m is called a lattice measure on the lattice σ-algebra σ L . i m ∅ L0. ii For all f, g ∈ σ L such that m f , m g ≥ L0 : f ≤ g ⇒ m f ≤ m g ...

As a generalization of the L-fuzzy contexts, we propose the study of the L-fuzzy hypercontexts where the relation R between the objects X and the attributes Y takes as values other L-fuzzy relations. In this work, we propose the study of these structures using OWA operators in different situations. Finally, the practical case that has motivated this paper is analyzed.

The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...

This paper deals with database fuzzy queries in the context where the fuzzy preference conditions involved are of a bipolar nature (the first pole corresponding to a constraint, the second to a wish). More precisely, we consider queries where an inclusion-based condition comes into play (a typical example being a division query). Due to the fact that bipolar fuzzy queries entail using a framewo...

In this paper, we present a new vision for studying ${F}$-open, ${F}$-continuous, and ${F}$-irresolute function in $(L,M)$-fuzzy topological spaces based on the implication operation and $(L,M)$-fuzzy ${F}$-open operator cite{2}. These kinds of functions are generalized with their elementary properties to $(L,M)$-fuzzy topological spaces setting based on graded concepts. Moreover, a systematic ...

Fuzzy relations as representational tools and fuzzy compositional operators as reasoning components, are user in this paper in order to represent knowledge expressed in semantic rules. Furthermore, neural representation and resolution of composite fuzzy relation equations provides knowledge refinement and adaptation to a specific context. A two-layer fuzzy compositional neural network is propos...

− We discuss the concept of robustness with respect to parsing a context-free language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy context-free grammar and parser / recognizer for fuzzy languages. As concrete examples we consider a robust version of Cocke−Younger−Kasami’s algorithm and a robust kind of recursive descent recognizer.