| Author(s): |
Cozman, Fabio Gagliardi
;
Maua, Denis Deratani
;
Augustin, T
;
Doria, S
;
Miranda, E
;
Quaeghebeur, E
Total Authors: 6
|
| Document type: | Journal article |
| Source: | 2022 25TH INTERNATIONAL CONFERENCE ON INFORMATION FUSION (FUSION 2022); v. N/A, p. 9-pg., 2015-01-01. |
| Abstract | |
A credal network associates a directed acyclic graph with a collection of sets of probability measures. Usually these probability measures are specified through several tables containing probability values. Here we examine the complexity of inference in Boolean credal networks when probability measures are specified through formal languages, by extending a framework we have recently proposed for Bayesian networks. We show that sub- Boolean and relational logics lead to interesting complexity results. In short, we explore the relationship between language and complexity in credal networks. (AU) | |
| FAPESP's process: | 13/23197-4 - Efficient algorithms for graph-based decision making under uncertainty |
| Grantee: | Denis Deratani Mauá |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |