Abstract
This paper presents a new direction in the area of compiling Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an appropriate form. From there, all possible queries are answerable in linear time relative to the size of the logical form. Therefore, our approach is a potential solution for real-time applications of probabilistic inference with limited computational resources. The underlying idea is similar to both the differential and the weighted model counting approach to inference in Bayesian networks, but at the core of the proposed encoding we avoid the transformation from discrete to binary variables. This alternative encoding enables a more natural solution.
This is a preview of subscription content, log in via an institution to check access.
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
Guo, H., Hsu, W.H.: Asurvey of algorithms for real-time Bayesian network inference. In: Joint Workshop on Real-Time Decision Support and Diagnosis Systems (2002)
Sang, T., Beame, P., Kautz, H.: Solving Bayesian networks by weighted model counting. In: 20th National Conference on Artificial Intelligence, vol. 1 (2005)
Darwiche, A.: A differential approach to inference in Bayesian networks. Journal of the ACM 50(3), 280–305 (2003)
Chavira, M., Darwiche, A.: Compiling Bayesian networks using variable elimination. In: 20th International Joint Conference on Artificial Intelligence (2007)
Darwiche, A.: A logical approach to factoring belief networks. In: KR 2002, 8th International Conference on Principles and Knowledge Representation and Reasoning, Toulouse, France, pp. 409–420 (2002)
Darwiche, A.: A compiler for deterministic, decomposable negation normal form. In: 18th National Conference on Artificial Intelligence, pp. 627–634 (2002)
Boutilier, C., Friedman, N., Goldszmidt, M., Koller, D.: Context-specific independence in Bayesian networks. In: 12th Conference on Uncertainty in Artificial Inteligence, pp. 115–123 (1996)
Chavira, M., Darwiche, A.: Compiling Bayesian networks with local structure. In: 19th International Joint Conference on Artificial Intelligence (2005)
Chavira, M., Darwiche, A., Jaeger, M.: Compiling relational Bayesian networks for exact inference. International Journal of Approximate Reasoning 42(1-2) (2006)
Wachter, M., Haenni, R.: Logical compilation of Bayesian networks. Technical Report iam-06-006, University of Bern, Switzerland (2006)
Wachter, M., Haenni, R.: Multi-state directed acyclic graphs. In: Kobti, Z., Wu, D. (eds.) Canadian AI 2007. LNCS (LNAI), vol. 4509, pp. 464–475. Springer, Heidelberg (2007)
Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research 17, 229–264 (2002)
Wachter, M., Haenni, R.: Propositional DAGs: a new graph-based language for representing Boolean functions. In: KR 2006, 10th International Conference on Principles of Knowledge Representation and Reasoning, pp. 277–285 (2006)
Palacios, H., Bonet, B., Darwiche, A., Geffner, H.: Pruning conformant plans by counting models on compiled d-DNNF representations. In: 15th International Conference on Planning and Scheduling, pp. 141–150 (2005)
Boole, G.: The Laws of Thought. Walton and Maberley (1854)
Kohlas, J.: Information Algebras: Generic Stuctures for Inference. Springer, Heidelberg (2003)
Davis, S., Putnam, M.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201–215 (1960)
Darwiche, A.: Decomposable negation normal form. Journal of the ACM 48(4), 608–647 (2001)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo (1988)
Haenni, R.: Towards a unifying theory of logical and probabilistic reasoning. In: 4th International Symposium on Imprecise Probabilities and Their Applications, pp. 193–202 (2005)
Haenni, R., Kohlas, J., Lehmann, N.: Probabilistic argumentation systems. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, Algorithms for Uncertainty and Defeasible Reasoning, vol. 5, pp. 221–288 (2000)
Darwiche, A.: New advances in compiling CNF to decomposable negational normal form. In: 16th European Conference on Artificial Intelligence (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wachter, M., Haenni, R. (2007). Logical Compilation of Bayesian Networks with Discrete Variables. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)