Skip navigation
Skip navigation

Optimal and efficient filtering algorithms for table constraints

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]

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
Source: Constraints
DOI: 10.1007/s10601-013-9156-0


File Description SizeFormat Image
01_Mairy_Optimal_and_efficient_2013.pdf2.82 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator