16 research outputs found

    Intersections between some families of (U,N)- and RU-implications

    Get PDF
    (U,N)-implications and RU-implications are the generalizations of (S,N)- and R-implications to the framework of uninorms, where the t-norms and t-conorms are replaced by appropriate uninorms. In this work, we present the intersections that exist between (U,N)-implications and the different families of RU-implications obtainable from the well-established families of uninorms

    Distributivity of strong implications over conjunctive and disjunctive uninorms

    Get PDF
    summary:This paper deals with implications defined from disjunctive uninorms UU by the expression I(x,y)=U(N(x),y)I(x,y)=U(N(x),y) where NN is a strong negation. The main goal is to solve the functional equation derived from the distributivity condition of these implications over conjunctive and disjunctive uninorms. Special cases are considered when the conjunctive and disjunctive uninorm are a tt-norm or a tt-conorm respectively. The obtained results show a lot of new solutions generalyzing those obtained in previous works when the implications are derived from tt-conorms

    A map of dependencies among three-valued logics

    Get PDF
    International audienceThree-valued logics arise in several fields of computer science, both inspired by concrete problems (such as in the management of the null value in databases) and theoretical considerations. Several three-valued logics have been defined. They differ by their choice of basic connectives, hence also from a syntactic and proof-theoretic point of view. Different interpretations of the third truth value have also been suggested. They often carry an epistemic flavor. In this work, relationships between logical connectives on three-valued functions are explored. Existing theorems of functional completeness have laid bare some of these links, based on specific connectives. However we try to draw a map of such relationships between conjunctions, negations and implications that extend Boolean ones. It turns out that all reasonable connectives can be defined from a few of them and so all known three-valued logics appear as a fragment of only one logic. These results can be instrumental when choosing, for each application context, the appropriate fragment where the basic connectives make full sense, based on the appropriate meaning of the third truth-value

    Information Aggregation in Intelligent Systems Using Generalized Operators

    Get PDF
    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

    On triangular norms and uninorms definable in ŁΠ12

    Get PDF
    AbstractIn this paper, we investigate the definability of classes of t-norms and uninorms in the logic ŁΠ12. In particular we provide a complete characterization of definable continuous t-norms, weak nilpotent minimum t-norms, conjunctive uninorms continuous on [0,1), and idempotent conjunctive uninorms, and give both positive and negative results concerning definability of left-continuous t-norms (and uninorms). We show that the class of definable uninorms is closed under construction methods as annihilation, rotation and rotation–annihilation. Moreover, we prove that every logic based on a definable uninorm is in PSPACE, and that any finitely axiomatizable logic based on a class of definable uninorms is decidable. Finally we show that the Uninorm Mingle Logic (UML) and the Basic Uninorm Logic (BUL) are finitely strongly standard complete w.r.t. the related class of definable left-continuous conjunctive uninorms

    Three-valued logics, uncertainty management and rough sets

    Get PDF
    This paper is a survey of the connections between three-valued logics and rough sets from the point of view of incomplete information management. Based on the fact that many three-valued logics can be put under a unique algebraic umbrella, we show how to translate three-valued conjunctions and implications into operations on ill-known sets such as rough sets. We then show that while such translations may provide mathematically elegant algebraic settings for rough sets, the interpretability of these connectives in terms of an original set approximated via an equivalence relation is very limited, thus casting doubts on the practical relevance of truth-functional logical renderings of rough sets

    Faculty of Sciences

    Get PDF
    A comprehensive study of fuzzy rough sets and their application in data reductio
    corecore