Article first published online: 16 APR 2013
© 2013 Wiley Periodicals, Inc.
International Journal of Intelligent Systems
Volume 28, Issue 7, pages 709–727, July 2013
How to Cite
Kagan, E., Rybalov, A., Siegelmann, H. and Yager, R. (2013), Probability-Generated Aggregators. Int. J. Intell. Syst., 28: 709–727. doi: 10.1002/int.21598
- Issue published online: 6 MAY 2013
- Article first published online: 16 APR 2013
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 thus—of the probability distribution using t-norm and t-conorm—is 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.