From MDD to BDD and Arc consistency

In this paper, we present a new conversion of multivalued decision diagrams (MDD) to binary decision diagrams (BDD) which can be used to improve MDD-based fil- tering algorithms such as MDDC or MDD-4R. We also propose BDDF, an algorithm that copies modified parts of the BDD “on the fly” during the search of a solution, and yields a better incrementality than a pure MDDC-like approach. MDDC is not very efficient when used to represent poorly structured positive table constraints. Our new representation combined with BDDF retains the properties of the MDD representation and has comparable performances to the STR2 algorithm by Ullmann (2007) and Lecoutre (Constraints, 16.4, 341–371 2011).

[1]  Jean-Charles Régin,et al.  Efficient Operations On MDDs for Building Constraint Programming Models , 2015, IJCAI.

[2]  Jean-Charles Régin,et al.  Improving GAC-4 for Table and MDD Constraints , 2014, CP.

[3]  Pascal Van Hentenryck,et al.  Optimal and efficient filtering algorithms for table constraints , 2013, Constraints.

[4]  Toby Walsh,et al.  CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[5]  Linda Torczon,et al.  An efficient representation for sparse sets , 1993, LOPL.

[6]  Roland H. C. Yap,et al.  Maintaining Generalized Arc Consistency on Ad-Hoc n-Ary Boolean Constraints , 2006, ECAI.

[7]  Robert E. Tarjan,et al.  Making Data Structures Persistent , 1989, J. Comput. Syst. Sci..

[8]  Christophe Lecoutre,et al.  STR2: optimized simple tabular reduction for table constraints , 2011, Constraints.

[9]  Phil Bagwell,et al.  Ideal Hash Trees , 2001 .

[10]  Roland H. C. Yap,et al.  An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints , 2010, Constraints.

[11]  Jon Louis Bentley.  Programming pearls: a sample of brilliance , 1987, CACM.

[12]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[13]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[14]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[15]  André Augusto Ciré,et al.  The Separation Problem for Binary Decision Diagrams , 2014, ISAIM.

[16]  John A. Allen,et al.  The anatomy of lisp , 1980 .

[17]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[18]  Christophe Lecoutre.  XML Representation of Constraint Networks , 2010 .

[19]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[20]  Peter J. Stuckey,et al.  The MiniZinc Challenge 2008-2013 , 2014, AI Mag..

[21]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[22]  Ian P. Gent,et al.  Data Structures for Generalised Arc Consistency for Extensional Constraints , 2007, AAAI.

[23]  Peter J. Stuckey,et al.  MDD propagators with explanation , 2011, Constraints.

[24]  Sylvain Piechowiak,et al.  Maintenir des MDD persistants pour établir la consistance d'arc , 2014, Rev. d'Intelligence Artif..

[25]  Pierre Schaus,et al.  Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets , 2016, CP.

[27]  Christophe Lecoutre,et al.  A Study of Residual Supports in Arc Consistency , 2007, IJCAI.

[28]  D. Michie.  “Memo” Functions and Machine Learning , 1968, Nature.

[29]  David Bergman,et al.  MDD Propagation for Sequence Constraints , 2014, J. Artif. Intell. Res..

[30]  Tarik Hadzic,et al.  On Automata , MDDs and BDDs in Constraint Satisfaction , 2008 .

[31]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[32]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[33]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[34]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[35]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[36]  Ke Xu,et al.  A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.

[37]  Julian R. Ullmann,et al.  Partition search for non-binary constraint satisfaction , 2007, Inf. Sci..

[38]  Roland H. C. Yap,et al.  A Path-Optimal GAC Algorithm for Table Constraints , 2012, ECAI.