Sparse-sets for domain implementation

This paper discusses the usage of sparse sets for integer do- main implementation over traditional representations. A first benefit of sparse sets is that they are very cheap to trail and restore. A second key advantage introduced in this work is that sparse sets permit to get delta changes with a very limited cost, allowing efficient incremental propaga- tion. Sparse sets can also be used to represent subset bound domains for set variables.

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

[2]  Mats Carlsson,et al.  Finite Domain Constraint Programming Systems , 2006, Handbook of Constraint Programming.

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

[4]  Panagiotis Stamatopoulos,et al.  Flexible Management of Large-Scale Integer Domains in CSPs , 2010, SETN.

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

[6]  Carmen Gervet.  New structures of symbolic constraint objects: sets and graphs , 1993 .

[7]  Christian Schulte,et al.  Advisors for Incremental Propagation , 2007, CP.

[8]  Christine Solnon,et al.  AllDifferent-based filtering for subgraph isomorphism , 2010, Artif. Intell..

[9]  Nicolas Beldiceanu,et al.  Time Stamps Techniques for the Trailed Data in Constraint Logic Programming Systems , 1990, SPLT.

[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]  Xavier Lorca,et al.  Choco: an Open Source Java Constraint Programming Library , 2008 .

[12]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

[13]  Yves Deville,et al.  Castor: A Constraint-Based SPARQL Engine with Active Filter Processing , 2012, ESWC.

[14]  Christian Schulte.  Comparing Trailing and Copying for Constraint Programming , 1999, ICLP.