Flow-Based Propagators for the SEQUENCE and Related Global Constraints

Authors:
Michael Maher;Nina Narodytska;Claude-Guy Quimper;Toby Walsh
Affiliations:
NICTA and UNSW, Sydney, Australia;NICTA and UNSW, Sydney, Australia;Ecole Polytechnique de Montreal, Montreal, Canada;NICTA and UNSW, Sydney, Australia
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 14
Cited 9

Theory of linear and integer programming

Theory of linear and integer programming
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Introduction to Algorithms

Introduction to Algorithms
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family

Proceedings of the 17th International Conference on Logic Programming
Arc Consistency for Global Cardinality Constraints with Costs

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
On global warming: Flow-based soft global constraints

Journal of Heuristics
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Encodings of the SEQUENCE constraint

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Revisiting the sequence constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Combination of among and cardinality constraints

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Fast and flexible difference constraint propagation for DPLL(T)

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Sequencing and Counting with the multicost-regular Constraint

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Determining the Number of Games Needed to Guarantee an NHL Playoff Spot

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The conjunction of interval among constraints

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Explaining flow-based propagation

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Exploiting constraints

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction

Journal of Artificial Intelligence Research
An optimal arc consistency algorithm for a chain of atmost constraints with cardinality

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The regulargcc matrix constraint

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
An optimal arc consistency algorithm for a particular case of sequence constraint

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose new filtering algorithms for the Sequenceconstraint and some extensions of the Sequenceconstraint based on network flows. We enforce domain consistency on the Sequenceconstraint 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(logn). 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 Gccsince 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.