arrow
Return

Probability-Generated Aggregators

delete2013-04-16
delete12
delete
OA
AI
E
Eugene Kagan *
A
Alexander Rybalov
H
Hava T. Siegelmann
R
Ronald R. Yager
DOI:10.1002/int.21598delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The paper addresses a relation between logical reasoning and probability and presents probability-generated aggregators. The obtained aggregators implement probability distributions for specification of generator functions; as it was proven in the paper, such implementation is always possible. In the paper, the relation between neutral element of the probabilistic uninorm and parameters of the underlying probability distribution is demonstrated, and a method for specification of the probabilistic uninorm, and thusof the probability distribution using t-norm and t-conormis constructed. In addition, the obtained probabilistic uninorm and probabilistic absorbing norm or nullnorm are briefly considered as algebraic operations on the open unit interval. In is demonstrated, that, in general, the obtained algebra is nondistributive and depends on the distributions, which are used for generating probabilistic uninorm and absorbing norm. The obtained results bridge several gaps between fuzzy and probabilistic logics and provide a basis both for theoretical studies in the field and for practical techniques of digital/analog schemes synthesis and analysis.
Keywords:
OPERATORS
UNINORMS
LOGICS

Journal

International Journal of Intelligent Systems cover
International Journal of Intelligent Systems
IF:
3.7
Papers:
3.0K
Citations:
8.1K

Organization

U
university of massachusetts system
Scholars:
3.8W
Papers: 3.5W
Citations: 42
Iona College cover
Iona College
Scholars:
115
Papers: 189
Citations: 227
U
University of Massachusetts Amherst
Scholars:
1.1W
Papers: 8.9K
Citations: 19
W
Weizmann Institute of Science
Scholars:
1.3W
Papers: 1.1W
Citations: 2.3W
researcher View more organizations