| Author(s): |
Maua, Denis D.
;
de Campos, Cassio P.
;
Cozman, Fabio G.
;
Yang, Q
;
Wooldridge, M
Total Authors: 5
|
| Document type: | Journal article |
| Source: | PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI); v. N/A, p. 7-pg., 2015-01-01. |
| Abstract | |
We study the computational complexity of finding maximum a posteriori configurations in Bayesian networks whose probabilities are specified by logical formulas. This approach leads to a fine grained study in which local information such as context-sensitive independence and determinism can be considered. It also allows us to characterize more precisely the jump from tractability to NP-hardness and beyond, and to consider the complexity introduced by evidence alone. (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 |