You are here

Sparse-Sets for Domain Implementation

TitleSparse-Sets for Domain Implementation
Publication TypeConference Proceedings
Year of Conference2013
Authorsle Clément, Vianney, Schaus Pierre, Solnon Christine, and Lecoutre Christophe
Conference NameTRICS - Techniques foR Implementing Constraint programming Systems, CP 2013 Workshop.
Keywordsconstraint programming, domain implementation, domain representation, sparse sets

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.