Abstract
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function decomposition structure. This yields AND/OR multi-valued decision diagram (AOMDD) which compiles a constraint network into a canonical form that supports polynomial time queries such as solution counting, solution enumeration or equivalence of constraint networks. We provide a compilation algorithm based on Variable Elimination for assembling an AOMDD for a constraint network starting from the AOMDDs for its constraints. The algorithm uses the apply operator which combines two AOMDDs by a given operation. This guarantees the complexity upper bound for the compilation time and the size of the AOMDD to be exponential in the treewidth of the constraint graph, rather than pathwidth as is known for ordered binary decision diagrams (OBDDs).
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
Dechter, R., Mateescu, R.: Mixtures of deterministic-probabilistic networks and their and/or search space. In: UAI 2004, pp. 120–129 (2004)
Dechter, R., Mateescu, R.: The impact of and/or search spaces on constraint satisfaction and counting. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 731–736. Springer, Heidelberg (2004)
Mateescu, R., Dechter, R.: The relationship between and/or search and variable elimination. In: UAI 2005, pp. 380–387 (2005)
Dechter, R., Mateescu, R.: And/or search spaces for graphical models. Artificial Intelligence (forthcoming, 2006)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
McMillan, K.L.: Symbolic Model Checking. Kluwer Academic, Dordrecht (1993)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers 35, 677–691 (1986)
Brayton, R., McMullen, C.: The decomposition and factorization of boolean expressions. In: ISCAS, Proceedings of the International Symposium on Circuits and Systems, pp. 49–54 (1982)
Bertacco, V., Damiani, M.: The disjunctive decomposition of logic functions. In: ICCAD, International Conference on Computer-Aided Design, pp. 78–82 (1997)
McMillan, K.L.: Hierarchical representation of discrete functions with application to model checking. In: Computer Aided Verification, pp. 41–54 (1994)
Fargier, H., Vilarem, M.: Compiling csps into tree-driven automata for interactive solving. Constraints 9(4), 263–287 (2004)
Freuder, E.C., Quinn, M.J.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: IJCAI 1985, pp. 1076–1078 (1985)
Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, London (1972)
Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85 (1999)
Bayardo, R., Miranker, D.: A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In: AAAI 1996, pp. 298–304 (1996)
Darwiche, A.: Recursive conditioning. Artificial Intelligence 125(1-2), 5–41 (2001)
Wilson, N.: Decision diagrams for the computation of semiring valuations. In: IJCAI 2005, pp. 331–336 (2005)
Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research (JAIR) 17, 229–264 (2002)
Huang, J., Darwiche, A.: Dpll with a trace: From sat to knowledge compilation. In: IJCAI 2005, pp. 156–162 (2005)
McAllester, D., Collins, M., Pereira, F.: Case-factor diagrams for structured probabilistic modeling. In: UAI 2004, pp. 382–391 (2004)
Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38, 353–366 (1989)
Cobb, J.: Joining and/or networks. Report, Radcliffe fellowship, Cambridge, MA (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mateescu, R., Dechter, R. (2006). Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_25
Download citation
DOI: https://doi.org/10.1007/11889205_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)