Evaluation of length-lex set variables

Authors:
Justin Yip;Pascal Van Hentenryck
Affiliations:
Department of Computer Science, Brown University;Department of Computer Science, Brown University
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 16
Cited 6

Dual viewpoint heuristics for binary constraint satisfaction problems

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Exploiting symmetries within constraint satisfaction search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Breaking Row and Column Symmetries in Matrix Models

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
Cardinal: A Finite Sets Constraint Solver

Constraints
Enhancing set constraint solvers with lexicographic bounds

Journal of Heuristics
Length-lex bound consistency for knapsack constraints

Proceedings of the 2009 ACM symposium on Applied Computing
Length-lex ordering for set CSPs

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
An efficient way of breaking value symmetries

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Combining Symmetry Breaking and Global Constraints

Recent Advances in Constraints
Bound consistency for binary length-lex set constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research
Propagation algorithms for lexicographic ordering constraints

Artificial Intelligence
Filtering atmost1 on pairs of set variables

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
General symmetry breaking constraints

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

Exponential propagation for set variables

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Fast set bounds propagation using a BDD-SAT hybrid

Journal of Artificial Intelligence Research
Checking and filtering global set constraints

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Partial symmetry breaking by local search in the group

Constraints
Symmetry breaking via LexLeader feasibility checkers

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier work and two novel technical contributions: a generic filtering algorithm which automatically pushes ordering constraints into symmetric binary constraints with only a logarithmic overhead and an adaptation of symmetry-breaking constraints from 0/1 matrices to the length-lex ordering. The experimental results indicate that the length-lex representation for set variables is very effective and robust on traditional set-CSPs benchmarks.