About the equivalence of nullnorms on bounded lattice

summary:In this paper, an equivalence on the class of nullnorms on a bounded lattice based on the equality of the orders induced by nullnorms is introduced. The set of all incomparable elements w.r.t. the order induced by nullnorms is investigated. Finally, the recently posed open problems have been solved

An extension of the ordering based on nullnorms

summary:In this paper, we generally study an order induced by nullnorms on bounded lattices. We investigate monotonicity property of nullnorms on bounded lattices with respect to the $F$-partial order. Also, we introduce the set of incomparable elements with respect to the F-partial order for any nullnorm on a bounded lattice. Finally, we investigate the relationship between the order induced by a nullnorm and the distributivity property for nullnorms

Fitting aggregation operators to data

Theoretical advances in modelling aggregation of information produced a wide range of aggregation operators, applicable to almost every practical problem. The most important classes of aggregation operators include triangular norms, uninorms, generalised means and OWA operators.With such a variety, an important practical problem has emerged: how to fit the parameters/ weights of these families of aggregation operators to observed data? How to estimate quantitatively whether a given class of operators is suitable as a model in a given practical setting? Aggregation operators are rather special classes of functions, and thus they require specialised regression techniques, which would enforce important theoretical properties, like commutativity or associativity. My presentation will address this issue in detail, and will discuss various regression methods applicable specifically to t-norms, uninorms and generalised means. I will also demonstrate software implementing these regression techniques, which would allow practitioners to paste their data and obtain optimal parameters of the chosen family of operators.<br /

On the construction of t-norms (t-conorms) by using interior (closure) operator on bounded lattices

summary:Recently, the topic of construction methods for triangular norms (triangular conorms), uninorms, nullnorms, etc. has been studied widely. In this paper, we propose construction methods for triangular norms (t-norms) and triangular conorms (t-conorms) on bounded lattices by using interior and closure operators, respectively. Thus, we obtain some proposed methods given by Ertuğrul, Karaçal, Mesiar [15] and Çaylı [8] as results. Also, we give some illustrative examples. Finally, we conclude that the introduced construction methods can not be generalized by induction to a modified ordinal sum for t-norms and t-conorms on bounded lattices

Order from non-associative operations

Algebraic structures are often converted to ordered structures to gain information about the algebra using the properties of partially ordered sets. Such studies have been predominantly undertaken for semigroups, using various proposed relations. This has led to a spate of works dealing with associative fuzzy logic connectives (FLCs) and the orders that they generate. One such relation, proposed by Clifford, is employed both for its generality as well as utility. In a recent work, Gupta and Jayaram classified the semigroups that yield a partial order through the relation. In this work, we characterise groupoids that would give a partial order by introducing a property called the Generalised Quasi-Projectivity. Further, for the groupoids that lead to an ordered set, we explore the monotonicity of the underlying groupoid operation on the obtained poset. Finally, in light of the above results, we explore the major non-associative fuzzy logic connectives along these lines, thus complementing and augmenting, already existing works in the literature. Our work also shows when an FLC from a given class of operations remains one even w.r.to the order generated from it

Fuzzy Mathematics

This book provides a timely overview of topics in fuzzy mathematics. It lays the foundation for further research and applications in a broad range of areas. It contains break-through analysis on how results from the many variations and extensions of fuzzy set theory can be obtained from known results of traditional fuzzy set theory. The book contains not only theoretical results, but a wide range of applications in areas such as decision analysis, optimal allocation in possibilistics and mixed models, pattern classification, credibility measures, algorithms for modeling uncertain data, and numerical methods for solving fuzzy linear systems. The book offers an excellent reference for advanced undergraduate and graduate students in applied and theoretical fuzzy mathematics. Researchers and referees in fuzzy set theory will find the book to be of extreme value

Mathematical Fuzzy Logic in the Emerging Fields of Engineering, Finance, and Computer Sciences

Mathematical fuzzy logic (MFL) specifically targets many-valued logic and has significantly contributed to the logical foundations of fuzzy set theory (FST). It explores the computational and philosophical rationale behind the uncertainty due to imprecision in the backdrop of traditional mathematical logic. Since uncertainty is present in almost every real-world application, it is essential to develop novel approaches and tools for efficient processing. This book is the collection of the publications in the Special Issue “Mathematical Fuzzy Logic in the Emerging Fields of Engineering, Finance, and Computer Sciences”, which aims to cover theoretical and practical aspects of MFL and FST. Specifically, this book addresses several problems, such as:- Industrial optimization problems- Multi-criteria decision-making- Financial forecasting problems- Image processing- Educational data mining- Explainable artificial intelligence, etc