Abstract
We provide a novel method for Bayesian network inference based upon the idea of pre-compiling a given Bayesian network into a series of SAT instances. We show that this approach allows us to exploit the numerical structure of the problem domain represented by the Bayesian network and that it can be combined with the paradigm of dynamic programming to exploit both the topology and the numerical structure of the network. Because these SAT-based methods exploit both, they are assured of performing better than traditional methods that exploit only the topology of the network (sometimes referred to as “structure-based methods”). A surprising result that follows from our approach is that in domains that exhibit “high” numerical structure, we can remove the “hardness” of the Bayesian inference task into a one-time precompilation phase that is independent of any query, thereby achieving a fully polynomial-time randomized approximation scheme (FPRAS) for query-answering. We expect SAT-based approaches to be successful in many practical domains that exhibit good numerical structure (like the presence of monotonic/qualitative relationships between the variables of the domain).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dechter, R. Constraint Networks. Encyclopedia of Artificial Intelligence, second edition, Wiley and Sons, pp 276–285, 1992.
Jensen, F.V. and Jensen, F. Optimal Junction Trees. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence. 1994.
Kaxp, R., Luby, M. and Madras, N. Monte-Carlo Approximation Algorithms for Enumeration Problems. Journal of Algorithms 10 429 – 448. 1989.
Kumax, T.K.S. and Dearden, R. The Oracular Constraints Method. Proceedings of the Fifth International Symposium on Abstraction, Reformulation and Approximation (SARA 2002 ).
Taxjan, R.E. and Yannakakis, M. Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal of Computing. 13 566 – 576. 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag London Limited
About this paper
Cite this paper
Kumar, T.K.S. (2003). SAT-Based Algorithms for Bayesian Network Inference. In: Bramer, M., Preece, A., Coenen, F. (eds) Research and Development in Intelligent Systems XIX. Springer, London. https://doi.org/10.1007/978-1-4471-0651-7_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0651-7_10
Publisher Name: Springer, London
Print ISBN: 978-1-85233-674-5
Online ISBN: 978-1-4471-0651-7
eBook Packages: Springer Book Archive