The paper deals with uninorms and nullnorms as basic operations which are associative, commutative and monotone (increasing). These operations were first introduced on the unit interval and later generalized to bounded lattices. In this contribution we show how it is possible to generalize them to bounded posets. We will study their existence, property and conditions under which it is possible to construct their idempotent versions, since these are the most important operations from the point of view of possible applications.
CITATION STYLE
Kalina, M. (2019). Uninorms and Nullnorms and their Idempotent Versions on Bounded Posets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11676 LNAI, pp. 126–137). Springer Verlag. https://doi.org/10.1007/978-3-030-26773-5_12
Mendeley helps you to discover research relevant for your work.