Approximate Compilation of Constraints into Multivalued Decision Diagrams

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5202)


We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex splitting operation that relies on the detection of equivalent paths in the MDD. Although the algorithm is quite general, it can be adapted to exploit constraint structure by specializing the equivalence tests for partial assignments to particular constraints. We show how to modify the algorithm in a principled way to obtain an approximate MDD when the exact MDD is too large for practical purposes. This is done by replacing the equivalence test with a constraint-specific measure of distance. We demonstrate the value of the approach for approximate and exact MDD compilation and evaluate its benefits in one of the main MDD application domains, interactive configuration.


Equivalence Class Equivalence Test Binary Decision Diagram Partial Assignment Individual Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Vempaty, N.R.: Solving constraint satisfaction problems using finite state automata. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 453–458 (1992)Google Scholar
  2. 2.
    Hadzic, T., Andersen, H.R.: A BDD-based Polytime Algorithm for Cost-Bounded Interactive Configuration. In: Proceedings of AAAI 2006 (2006)Google Scholar
  3. 3.
    Mateescu, R., Dechter, R.: Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs). In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 329–343. Springer, Heidelberg (2006)Google Scholar
  4. 4.
    Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research 17, 229–264 (2002)Google Scholar
  5. 5.
    Hadzic, T., Hooker, J.N.: Cost-bounded binary decision diagrams for 0-1 programming. In: Hentenryck, P.V., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 84–98. Springer, Heidelberg (2007)Google Scholar
  6. 6.
    Ravi, K., Somenzi, F.: High-density reachability analysis. In: ICCAD 1995: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, Washington, DC, USA, pp. 154–158. IEEE Computer Society, Los Alamitos (1995)Google Scholar
  7. 7.
    Ravi, K., McMillan, K.L., Shiple, T.R., Somenzi, F.: Approximation and decomposition of binary decision diagrams. In: Design Automation Conference, pp. 445–450 (1998)Google Scholar
  8. 8.
    Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemman, P.: A Constraint Store Based on Multivalued Decision Diagrams. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118–132. Springer, Heidelberg (2007)Google Scholar
  9. 9.
    Huang, J., Darwiche, A.: DPLL with a trace: From SAT to knowledge compilation. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 156–162. Professional Book Center (2005)Google Scholar
  10. 10.
    Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers (1986)Google Scholar
  11. 11.
    Jensen, R.M.: CLab: A C++ library for fast backtrack-free interactive product configuration (2007),
  12. 12.
    CLib: Configuration benchmarks library (2007),

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  1. 1.Cork Constraint Computation Centre 
  2. 2.Carnegie Mellon University 
  3. 3.IT University of Copenhagen 

Personalised recommendations