Filters
States in Lukasiewicz logic correspond to probabilities of rational polyhedra
It will be shown that probabilities of infinite-valued events represented by formulas in Lukasiewicz propositional logic are in one-to-one correspondence with tight probability measures over rational polyhedra in the unit hypercube. This result gener...
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A Generalized Moebius Transform of Games on MV-algebras and Its Application to a Cimmino-type Algorithm for the Core
A generalization of the Moebius transform of games with finitely many players is introduced for games on MV-algebras. The variety of MV- algebras subsumes most coalition models. We characterize the class of games for which the generalized Moebius tra...
BA - Obecná matematika
- 2012 •
- C •
- Link
Rok uplatnění
C - Kapitola v odborné knize
Výsledek na webu
Extension of belief functions to infinite-valued events
We generalise belief functions to many-valued events which are represented by elements of Lindenbaum algebra of infinite-valued Łukasiewicz propositional logic. Our approach is based on mass assignments used in the Dempster?Shafer theory of evidence....
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
All roads lead to Rome - New search methods for the optimal triangulation problem
To perform efficient inference in Bayesian networks by means of a Junction Tree method, the network graph needs to be triangulated. The quality of this triangulation largely determines the efficiency of the subsequent inference, but the triangulation...
BD - Teorie informace
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Characteristic Properties of Equivalent Structures in Compositional Models
Compositional model theory serves as an alternative to Bayesian networks. Every compositional model over a finite non-empty set of variables N is uniquely defined by its generating sequence ? an ordered set of low-dimensional probability distribution...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Foundations of compositional model theory
The paper is a survey of the most important basic concepts and results concerning compositional models necessary for reading advanced papers on computational procedures and other aspects connected with this (relatively new) approach for multidimensio...
IN - Informatika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Rank of tensors of l-out-of-k functions: an application in probabilistic inference
We study the problem of efficient probabilistic inference with Bayesian networks when some of the conditional probability tables represent deterministic or noisy l-out-of-k functions. These tables appear naturally in real-world applications when we o...
BB - Aplikovaná statistika, operační výzkum
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Conditioning and Flexibility in Compositional Models
Reasoning by cases or assumptions is a common form of human reasoning. In case of probability reasoning, this is modeled by conditioning of a multidimensional probability distribution. Compositional models are defined as a multidimensional distributi...
BA - Obecná matematika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Belief Networks and Local Computations
This paper is one of many attempts to introduce graphical Markov models within Dempster-Shafer theory of evidence. Here we take full advantage of the notion of factorization, which in probability theory (almost) coincides with the notion of condition...
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
A Note on Factorization of Belief Functions
The paper compares two main types of factorization of belief functions (one based on the Dempster´s rule of combination, the other based on the operator of composition) and shows that both the approaches are equivalent to each other in case of uncond...
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 26