Implication functions in interval-valued fuzzy set theory

Interval-valued fuzzy set theory is an extension of fuzzy set theory in which the real, but unknown, membership degree is approximated by a closed interval of possible membership degrees. Since implications on the unit interval play an important role in fuzzy set theory, several authors have extended this notion to interval-valued fuzzy set theory. This chapter gives an overview of the results pertaining to implications in interval-valued fuzzy set theory. In particular, we describe several possibilities to represent such implications using implications on the unit interval, we give a characterization of the implications in interval-valued fuzzy set theory which satisfy the Smets-Magrez axioms, we discuss the solutions of a particular distributivity equation involving strict t-norms, we extend monoidal logic to the interval-valued fuzzy case and we give a soundness and completeness theorem which is similar to the one existing for monoidal logic, and finally we discuss some other constructions of implications in interval-valued fuzzy set theory

On the distributivity equation for uni-nullnorms

summary:A uni-nullnorm is a special case of 2-uninorms obtained by letting a uninorm and a nullnorm share the same underlying t-conorm. This paper is mainly devoted to solving the distributivity equation between uni-nullnorms with continuous Archimedean underlying t-norms and t-conorms and some binary operators, such as, continuous t-norms, continuous t-conorms, uninorms, and nullnorms. The new results differ from the previous ones about the distributivity in the class of 2-uninorms, which have not yet been fully characterized

On Lipschitz properties of generated aggregation functions

This article discusses Lipschitz properties of generated aggregation functions. Such generated functions include triangular norms and conorms, quasi-arithmetic means, uninorms, nullnorms and continuous generated functions with a neutral element. The Lipschitz property guarantees stability of aggregation operations with respect to input inaccuracies, and is important for applications. We provide verifiable sufficient conditions to determine when a generated aggregation function holds the k-Lipschitz property, and calculate the Lipschitz constants of power means. We also establish sufficient conditions which guarantee that a generated aggregation function is not Lipschitz. We found the only 1-Lipschitz generated function with a neutral element e &isin;]0, 1[.<br /

Notes on locally internal uninorm on bounded lattices

summary:In the study, we introduce the definition of a locally internal uninorm on an arbitrary bounded lattice $L$. We examine some properties of an idempotent and locally internal uninorm on an arbitrary bounded latice $L$, and investigate relationship between these operators. Moreover, some illustrative examples are added to show the connection between idempotent and locally internal uninorm

Information Aggregation in Intelligent Systems Using Generalized Operators

Aggregation of information represented by membership functions is a central matter in intelligent systems where fuzzy rule base and reasoning mechanism are applied. Typical examples of such systems consist of, but not limited to, fuzzy control, decision support and expert systems. Since the advent of fuzzy sets a great number of fuzzy connectives, aggregation operators have been introduced. Some families of such operators (like t-norms) have become standard in the field. Nevertheless, it also became clear that these operators do not always follow the real phenomena. Therefore, there is a natural need for finding new operators to develop more sophisticated intelligent systems. This paper summarizes the research results of the authors that have been carried out in recent years on generalization of conventional operators

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 /