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

(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

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

Migrativity properties of 2-uninorms over semi-t-operators

summary:In this paper, we analyze and characterize all solutions about $\alpha$-migrativity properties of the five subclasses of 2-uninorms, i. e. $C^{k}$, $C^{0}_{k}$, $C^{1}_{k}$, $C^{0}_{1}$, $C^{1}_{0}$, over semi-t-operators. We give the sufficient and necessary conditions that make these $\alpha$-migrativity equations hold for all possible combinations of 2-uninorms over semi-t-operators. The results obtained show that for $G\in C^{k}$, the $\alpha$-migrativity of $G$ over a semi-t-operator $F_{\mu,\nu}$ is closely related to the $\alpha$-section of $F_{\mu,\nu}$ or the ordinal sum representation of t-norm and t-conorm corresponding to $F_{\mu,\nu}$. But for the other four categories, the $\alpha$-migrativity over a semi-t-operator $F_{\mu,\nu}$ is fully determined by the $\alpha$-section of $F_{\mu,\nu}$

NEW APPROACH TO INFORMATION AGGREGATION

In this paper new types of aggregation operators, namely absorbing-norms and parametric type of operator families called distance-based or evolutionary operators are introduced. Absorbing- norms are commutative, associative binary operators having an absorbing element from the uni! interval. A detailed discussion of properties and structure of these operators is given in the paper. Two types of distance-based operators are defined. The maximum and minimum distance operators with respect to e have the value of the element, which is farther, or nearer to e, respectively, where e is an arbitrary element of the unit interval [0,1]. The special cases e = O and e = 1lead to the max and min operators. The new operators are evolutionary types in the sense that if e is increasing starting from zero till e = 1 the min operator is developing into the max operator, while on the other side the max is transformed into the min operator. It is shown that the evolutionary operators can be constructed by means of min and max operators, which are also special cases of the operators. The maximum distance operators are special operators called uninorms and the minimum distance ones are absorbing-norms

A map of dependencies among three-valued logics

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

Algebraic Models for Qualified Aggregation in General Rough Sets, and Reasoning Bias Discovery

In the context of general rough sets, the act of combining two things to form another is not straightforward. The situation is similar for other theories that concern uncertainty and vagueness. Such acts can be endowed with additional meaning that go beyond structural conjunction and disjunction as in the theory of $*$-norms and associated implications over $L$-fuzzy sets. In the present research, algebraic models of acts of combining things in generalized rough sets over lattices with approximation operators (called rough convenience lattices) is invented. The investigation is strongly motivated by the desire to model skeptical or pessimistic, and optimistic or possibilistic aggregation in human reasoning, and the choice of operations is constrained by the perspective. Fundamental results on the weak negations and implications afforded by the minimal models are proved. In addition, the model is suitable for the study of discriminatory/toxic behavior in human reasoning, and of ML algorithms learning such behavior.Comment: 15 Pages. Accepted. IJCRS-202