Mairy, Jean-Baptiste; Van Hentenryck, Pascal; Deville, Yves
Filtering algorithms for table constraints can be classified in two categories: constraint-based and value-based. In the constraint-based approaches, the propagation queue only contains information on the constraints that must be reconsidered. For the value-based approaches, the propagation queue also contains information on the removed values. This paper proposes five efficient value-based algorithms for table constraints. Two of them (AC5TCOpt-Tr and AC5TCOpt-Sparse) are proved to have an...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.