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