4 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Calculating Valid Domains for BDD-Based Interactive Configuration
Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen
In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largel…
Generic Global Constraints based on MDDs
Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
Constraint Programming (CP) has been successfully applied to both constraint satisfaction and constraint optimization problems. A wide variety of specialized global constraints pro…
Interactive Configuration by Regular String Constraints
Esben Rune Hansen, Henrik Reif Andersen
A product configurator which is complete, backtrack free and able to compute the valid domains at any state of the configuration can be constructed by building a Binary Decision Di…
A Generic Global Constraint based on MDDs
Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generaliz…