Abstract
This paper studies the satisfaction of the well-known Non-Contradiction Principle within the class of uninorm aggregation functions, taking into account that this principle may be interpreted in two different ways (a strong one, based on falsity, and a weaker one, relying on self-contradiction). The logical negation is represented by means of strong negation functions, and the most important classes of uninorms are examined. © 2008 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Pradera, A. (2008). Uninorms and non-contradiction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5285 LNAI, pp. 50–61). Springer Verlag. https://doi.org/10.1007/978-3-540-88269-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
