Results 1 to 10 of about 120 (112)
Credal networks under epistemic irrelevance
International Journal of Approximate Reasoning, 2017 A credal network under epistemic irrelevance is a generalised type of Bayesian network that relaxes its two main building blocks. On the one hand, the local probabilities are allowed to be partially specified. On the other hand, the assessments of independence do not have to hold exactly.
Jasper de Bock
exaly +7 more sources
Updating credal networks is approximable in polynomial time [PDF]
International Journal of Approximate Reasoning, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marco Zaffalon +2 more
exaly +3 more sources
Artificial Intelligence, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabio Gagliardi Cozman
exaly +4 more sources
On the complexity of propositional and relational credal networks
International Journal of Approximate Reasoning, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Denis Deratani Maua +1 more
exaly +2 more sources
Credal networks for military identification problems
International Journal of Approximate Reasoning, 2009 AbstractCredal networks are imprecise probabilistic graphical models generalizing Bayesian networks to convex sets of probability mass functions. This makes credal networks particularly suited to model expert knowledge under very general conditions, including states of qualitative and incomplete knowledge. In this paper, we present a credal network for
Alessandro Antonucci, Marco Zaffalon
exaly +3 more sources
Approximate algorithms for credal networks with binary variables
International Journal of Approximate Reasoning, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaime Ide, Fabio Gagliardi Cozman
exaly +4 more sources
Advances in Neural Information Processing Systems 35, 2022 This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional probability bounds of logic formulas, this logic specifies a set of probability distributions over all interpretations.
Radu Marinescu 0002 +7 more
openaire +3 more sources
On the Complexity of Strong and Epistemic Credal Networks [PDF]
CoRR, 2013 Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013)
Mauá, Denis D. +3 more
openaire +5 more sources
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks [PDF]
, 2010 Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as constraints defining a second credal set. This simple procedure produces an outer approximation, with a bounded number of extreme points, for general credal sets.
Alessandro Antonucci 0001 +1 more
openaire +1 more source
Introduction : pour une mise en questions de l’appellation « réseau »
Cahiers des Amériques Latines, 2006 As an introduction for the file offered by the interdisciplinary team dedicated to the study of social networks in CREDAL, the paper sets their collective work in front of shared interrogations about the increasing action-in-network presence in Latin ...
Marielle Pepin Lehalleur
doaj +1 more source