Sparse-sets for domain implementation

le Clément de Saint-Marcq, Vianney;Schaus, Pierre;Solnon, Christine;Lecoutre, Christophe
(2013) The 19th International Conference on Principles and Practice of Constraint Programming — Location: Uppsala, Sweden (16.September.2013)

Files

cp13_molns.pdf
  • Restricted Access
  • Adobe PDF
  • 387.88 KB
Request a copy
trics13-sparsets.pdf
  • Restricted Access
  • Adobe PDF
  • 366.94 KB
Request a copy

Details

Authors
  • le Clément de Saint-Marcq, VianneyUCLouvain
    Author
  • Schaus, Pierreorcid-logoUCLouvain
    Author
  • Solnon, ChristineUniversité de Lyon
    Author
  • Lecoutre, ChristopheUniversité Lille Nord de France
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

le Clément de Saint-Marcq, V., Schaus, P., Solnon, C., & Lecoutre, C. (2013). Sparse-sets for domain implementation. The 19th International Conference on Principles and Practice of Constraint Programming, Uppsala, Sweden. https://hdl.handle.net/2078.5/231711