A Logical Approach to Factoring Belief Networks
Cached
Download Links
- [www3.cs.pitt.edu]
- [www.cs.pitt.edu]
- [www.cs.ucla.edu]
- [www.cs.ucla.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 40 - 9 self |
BibTeX
@MISC{Darwiche_alogical,
author = {Adnan Darwiche},
title = {A Logical Approach to Factoring Belief Networks},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We have recently proposed a tractable logical form, known as deterministic, decomposable negation normal form (d-DNNF). We have shown that d-DNNF supports a number of logical operations in polynomial time, including clausal entailment, model counting, model enumeration, model minimization, and probabilistic equivalence testing. In this paper, we discuss another major application of this logical form: the implementation of multi-linear functions (of exponential size) using arithmetic circuits (that are not necessarily exponential). Specifically, we show that each multi–linear function can be encoded using a propositional theory, and that each d-DNNF of the theory corresponds to an arithmetic circuit that implements the encoded multi–linear function. We discuss the application of these results to factoring belief networks, which can be viewed as multi–linear functions as has been shown recently. We discuss the merits of the proposed approach for factoring belief networks, and present experimental results showing how it can handle efficiently belief networks that are intractable to structure–based methods for probabilistic inference.
