Sparse-Sets for Domain Implementation

Vianney Le Clément de Saint-Marcq (1) , Pierre Schaus (2) , Christine Solnon (1) , Christophe Lecoutre (3)

1 M2DisCo - Geometry Processing and Constrained Optimization
2 UCL - Université Catholique de Louvain = Catholic University of Louvain
3 CRIL - Centre de Recherche en Informatique de Lens

This paper discusses the usage of sparse sets for integer domain 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 propagation. Sparse sets can also be used to represent subset bound domains for set variables.

Mots clés: Constraint Programming; Domains; Sparse-set; Incremental Filtering; Integer variable; Set variable; Subset bound

Domaines: Informatique [cs]

Vianney Le Clément de Saint-Marcq, Pierre Schaus, Christine Solnon, Christophe Lecoutre. Sparse-Sets for Domain Implementation. CP workshop on Techniques foR Implementing Constraint programming Systems (TRICS), Sep 2013, Uppsala, Sweden. pp.1-10. ⟨hal-01339250⟩