3 papers
cs.AI2008
Compressing Binary Decision Diagrams
Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompressio…
cs.AI2007
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…
cs.AI2006
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…