Sweep as a Generic Pruning Technique
Number of Authors: 1
2000 (English)Report (Refereed)
This report presents a generic pruning technique that aggregates several constraints sharing some variables. The method is derived from an idea called sweep that is extensively used in computational geometry. A first benefit of this technique comes from the fact that it can be applied on several families of global constraints. A second main advantage is that it does not lead to any memory consumption problem since it only requires temporary memory that can be reclaimed after each invocation of the method. This technique has been used inside the SICStus finite domain solver in order to implement several global constraints.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2000, 1. , 16 p.
SICS Technical Report, ISSN 1100-3154 ; 2000:08
Global constraint, Sweep
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22011OAI: oai:DiVA.org:ri-22011DiVA: diva2:1041553