110 research outputs found
Characterizations of quasitrivial symmetric nondecreasing associative operations
We provide a description of the class of n-ary operations on an arbitrary
chain that are quasitrivial, symmetric, nondecreasing, and associative. We also
prove that associativity can be replaced with bisymmetry in the definition of
this class. Finally we investigate the special situation where the chain is
finite
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 . We examine some properties of an idempotent and locally internal uninorm on an arbitrary bounded latice , and investigate relationship between these operators. Moreover, some illustrative examples are added to show the connection between idempotent and locally internal uninorm
Aggregation on bipolar scales
The paper addresses the problem of extending aggregation operators typically defined on to the symmetric interval , where the ``0'' value plays a particular role (neutral value). We distinguish the cases where aggregation operators are associative or not. In the former case, the ``0'' value may play the role of neutral or absorbant element, leading to pseudo-addition and pseudo-multiplication. We address also in this category the special case of minimum and maximum defined on some finite ordinal scale. In the latter case, we find that a general class of extended operators can be defined using an interpolation approach, supposing the value of the aggregation to be known for ternary vectors.bipolar scale; bi-capacity; aggregation
Visual characterization of associative quasitrivial nondecreasing operations on finite chains
In this paper we provide visual characterization of associative quasitrivial
nondecreasing operations on finite chains. We also provide a characterization
of bisymmetric quasitrivial nondecreasing binary operations on finite chains.
Finally, we estimate the number of functions belonging to the previous classes.Comment: 25 pages, 18 Figure
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 -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
Relating Kleene algebras with pseudo uninorms
This paper explores a strict relation between two core notions of the semantics of programs and of fuzzy logics: Kleene Algebras and (pseudo) uninorms. It shows that every Kleene algebra induces a pseudo uninorm, and that some pseudo uninorms induce Kleene algebras. This connection establishes a new perspective on the theory of Kleene algebras and provides a way to build (new) Kleene algebras. The latter aspect is potentially useful as a source of formalism to capture and model programs acting with fuzzy behaviours and domains.publishe
- …