Remarks on the lattices of fuzzy subsets of a groupoid

In this paper we give a necessary and sufficient condition for a groupoid D such that the sup-min product is distributive over arbitrary intersection of fuzzy subsets of D, and correct some results from the paper [S. Ray, The lattice of all idempotent fuzzy subsets of a groupoid, Fuzzy Sets and Systems 96 (1998) 239–245]. Also, we prove that the set of all idempotent fuzzy sets forms a complete lattice, which is a complete join-sublattice of the lattice of all fuzzy subgroupoids. This result extends the corresponding result from the above mentioned paper.     

Generalization of preinvex and B-vex fuzzy mappings

A class of fuzzy mappings, called B-preinvex, and strictly B-preinvex fuzzy mappings, is introduced by relaxing the definition of preinvexity of a fuzzy mapping. Similarly, based on a notion of differentiability of fuzzy mappings different from the usual one, the class of pseudo-B-vex, B-invex, and pseudo-B-invex fuzzy mappings is defined as a generalization of pseudo-convex, invex, and pseudo-invex fuzzy mappings. We prove that a strictly B-vex, or B-preinvex fuzzy mapping has at most one global minimum point, and that the class of B-vex fuzzy mappings forms a subset of the class of quasi-convex fuzzy mappings. B-vex (resp. B-preinvex) fuzzy mappings satisfy most of the basic properties of convex (resp. preinvex) fuzzy mappings. In addition characterizations and sufficient optimality conditions are obtained for B-vex and B-preinvex fuzzy mappings.     

Maximal residuated lattices with lifting boolean center

In this paper, we define, inspired by ring theory, the class of maximal residuated lattices with lifting boolean center and prove a structure theorem for them: any maximal residuated lattice with lifting boolean center is isomorphic to a finite direct product of local residuated lattices.     

Fuzzy Topological Representation Theory For D_(01)

In this paper, we shall introduce the concepts of fuzzy prime ideal, fuzzy Stone space, fuzzy fundamental set, etc. And the representations of a distributive lattice with 0, 1 (D_(01) denotes the equational class of such lattices) by fuzzy sets will be investigated and many useful results are obtained.     

The Lattices of Kernel Ideals in Pseudocomplemented De Morgan Algebras

In a pseudocomplemented de Morgan algebra, it is shown that the set of kernel ideals is a complete Heyting lattice, and a necessary and sufficient condition that the set of kernel ideals is boolean (resp. Stone) is derived. In particular, a characterization of a de Morgan Heyting algebra whose congruence lattice is boolean (resp. Stone) is given.     

格蕴涵代数的区间值模糊子代数

将区间值模糊集的概念应用于格蕴涵代数,引入区间值模糊格蕴涵子代数的概念并研究它们的性质.讨论了区间值模糊格蕴涵子代数与（模糊）格蕴涵子代数之间的关系;定义了区间值模糊集的象和原象,获得了区间值模糊格蕴涵子代数的象和原象成为区间值模糊格蕴涵子代数的条件.     

Triangular norms which are meet-morphisms in interval-valued fuzzy set theory

In this paper we study t-norms on the lattice of closed subintervals of the unit interval. Unlike for t-norms on a product lattice for which there exists a straightforward characterization of t-norms which are join-morphisms, respectively meet-morphisms, the situation is more complicated for t-norms in interval-valued fuzzy set theory. In previous papers several characterizations were given of t-norms in interval-valued fuzzy set theory which are join-morphisms and which satisfy additional properties, but little attention has been paid to meet-morphisms. Therefore, in this paper, we focus on t-norms which are meet-morphisms. We consider a general class of t-norms and investigate under which conditions t-norms belonging to this class are meet-morphisms. We also characterize the t-norms which are both a join- and a meet-morphism and which satisfy an additional border condition.     

模糊幂格

本文研究了格向其模糊幂集上提升的问题.利用模糊集理论,引入了模糊幂格的概念,获得了模糊幂格及其模糊理想的若干基本性质,推广了格的结果.     

半群的模糊理想和模糊同余

引入半群上模糊理想、模糊同余的概念。给出它们的一些等价刻划,证明了一个半群上所有模糊同余关系作成一个格。最后,给出模糊理想的积和模糊同余关系的积的概念,讨论了它们的一些性质。     

模糊概念格

概念格是研究和处理概念内涵与外延确定性关系的数学方法 ,已成为一种有效的数据分析方法。本文进一步探讨概念内涵与外延的不确定关系的模糊映射 ,给出相应的隶属函数的一些基本数学性质 ,证明全体模糊概念构成一个完全格。     

格蕴涵代数的（∈,∈∨q~[k]）-fuzzy LI-理想

运用fuzzy集的思想和方法研究格蕴涵代数的LI-理想.引入了（∈,∈∨q[k]）-fuzzy LI-理想和（∈,∈∨q[k]）-fuzzy格理想的概念,讨论了它们的性质及相互关系.获得了（∈,∈∨q[k]）-fuzzy LI-理想的若干等价刻画;证明了在格H蕴涵代数中（∈,∈∨q[k]）-fuzzy LI-理想和（∈,∈∨q[k]）-fuzzy格理想相互等价的结论.     

格蕴涵代数的直觉模糊LI-理想

本文深入研究了格蕴涵代数的直觉模糊\textit{LI}-理想理论.给出了直觉模糊\textit{LI}-理想的若干新的性质和等价刻画. 建立了由一个直觉模糊集生成的直觉模糊\textit{LI}-理想的表示定理.证明了一个格蕴涵代数的全体之集模糊\textit{LI}-理想之集在直觉模糊包含序下构成一个完备的分配格.     

Filters in (Quasiordered) Semigroups and Lattices of Filters

A filter in a semigroup is a subsemigroup whose complement is an ideal. (Alternatively, in a quasiordered semigroup, a slightly more general definition can be given.) We prove a number of results related to filters in a semigroup and the lattice of filters of a semigroup. For instance, we prove that every complete algebraic lattice can be the lattice of filters of a semigroup. We prove that every finite semigroup is a homomorphic image of a finite semigroup whose lattice of filters is boolean and which belongs to the pseudovariety generated by the original semigroup. We describe filter lattices of some well-known semigroups such as full transformation semigroups of finite sets (which are three-element chains) and free semigroups (which are boolean).     

Approximate String Matching Using Deformed Fuzzy Automata: A Learning Experience

Deformed fuzzy automata are complex structures that can be used for solving approximate string matching problems when input strings are composed by fuzzy symbols. Different string similarity definitions are obtained by the appropriate selection of fuzzy operators and parameters involved in the calculus of the automaton transitions. In this paper, we apply a genetic algorithm to adjust the automaton parameters for selecting the ones best fit to a particular application. This genetic approach overcomes the difficulty of using common optimizing techniques like gradient descent, due to the presence of non-derivable functions in the calculus of the automaton transitions. Experimental results, obtained in a text recognition experience, validate the proposed methodology.     

分配格中模糊理想诱导的模糊幂格

在模糊幂格讨论基础上,给出了由分配格中模糊理想诱导的两种模糊幂格.     

Notes on “A survey of fuzzy implication algebras and their axiomatization”

In this note, we present a correction of Theorem 2 in the paper [1], and show that all the conditions (I1)–(I5) in the definition of fuzzy implication algebras are independent of each other. In addition, we prove that the class of all commutative fuzzy implication algebras forms an equational algebra class.     

Finite distributive nearlattices

Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through finite posets. We also study finite distributive nearlattices through the concepts of dual atoms, boolean elements, complemented elements and irreducible elements. We prove that the sets of boolean elements and complemented elements form semi-boolean algebras. We show that the set of boolean elements of a finite distributive lattice is a boolean lattice.     

权值不确定的模糊多属性格序决策方法

针对权值是区间数且指标值以三角模糊数形式给出的模糊多属性决策问题,基于格序决策的理论,提出一种新的格序决策办法.方法通过计算梯形模糊数的中心将TOPSIS方法推广到了模糊数的领域,进而给出一种新的方案排序方法.     

Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.     

Fuzzy classifier identification using decision tree and multiobjective evolutionary algorithms

This paper presents a hybrid method for identification of Pareto-optimal fuzzy classifiers (FCs). In contrast to many existing methods, the initial population for multiobjective evolutionary algorithms (MOEAs) is neither created randomly nor a priori knowledge is required. Instead, it is created by the proposed two-step initialization method. First, a decision tree (DT) created by C4.5 algorithm is transformed into an FC. Therefore, relevant variables are selected and initial partition of input space is performed. Then, the rest of the population is created by randomly replacing some parameters of the initial FC, such that, the initial population is widely spread. That improves the convergence of MOEAs into the correct Pareto front. The initial population is optimized by NSGA-II algorithm and a set of Pareto-optimal FCs representing the trade-off between accuracy and interpretability is obtained. The method does not require any a priori knowledge of the number of fuzzy sets, distribution of fuzzy sets or the number of relevant variables. They are all determined by it. Performance of the obtained FCs is validated by six benchmark data sets from the literature. The obtained results are compared to a recently published paper [H. Ishibuchi, Y. Nojima, Analysis of interpretability-accuracy tradeoff of fuzzy systems by multiobjective fuzzy genetics-based machine learning, International Journal of Approximate Reasoning 44 (1) (2007) 4–31] and the benefits of our method are clearly shown.