Reasoning in singly-connected directed evidential networks with conditional beliefs

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Directed evidential networks are powerful tools for knowledge representation and uncertain reasoning in a belief function framework. In this paper, we propose an algorithm for the propagation of belief functions in the singly-connected directed evidential networks, when each node is associated with one conditional belief function distribution specified given all its parents. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Laâmari, W., & Yaghlane, B. B. (2014). Reasoning in singly-connected directed evidential networks with conditional beliefs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8445 LNCS, pp. 221–236). Springer Verlag. https://doi.org/10.1007/978-3-319-07064-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free