2009/09/24 by Michael J. Maher, Nina Narodytska, Maher, Michael J. +5
Computer Science · #Advanced Graph Theory Research #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #Data Management and Algorithms #FOS: Computer and information sciences #I.2.4 #cs.AI
paper · pdf · doi:10.48550/arxiv.0909.4452
Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings
arxiv created 2009/09/24 · openalex publication_date 2009/09/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE constraint in O(n2) time down a branch of the search tree. This improves upon the best existing domain consistency algorithm by a factor of O(log n). The flows used in these algorithms are derived from a linear program. Some of them differ from the flows used to propagate global constraints like GCC since the domains of the variables are encoded as costs on the edges rather than capacities. Such flows are efficient for maintaining bounds consistency over large domains and may be useful for other global constraints.