Length-Lex Bounds Consistency for Knapsack Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Length-lex bound consistency for knapsack constraints
Proceedings of the 2009 ACM symposium on Applied Computing
Bound consistency for binary length-lex set constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Evaluation of length-lex set variables
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A generalized-zero-preserving method for compact encoding of concept lattices
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Checking and filtering global set constraints
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Boosting set constraint propagation for network design
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Symmetry breaking via LexLeader feasibility checkers
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Extending the TOY system with the ECLiPSe solver over sets of integers
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
A constraint propagation approach to structural model based image segmentation and recognition
Information Sciences: an International Journal
| Hi-index | 0.00 |
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit and combinatorial design. In this paper we present and evaluate a new means towards improving the practical reasoning power of Finite Set (FS) constraint solvers to better address such set problems with a particular attention to the challenging symmetrical set problems often cast as Combinatorial Design Problems (CDPs). While CDPs find a natural formulation in the language of sets, in constraint programming literature, alternative models are often used due to a lack of efficiency of traditional FS solvers. We first identify the main structural components of CDPs that render their modeling suitable to set languages but their solving a technical challenge. Our new prototype solver extends the traditional subset variable domain with lexicographic bounds that better approximate a set domain by satisfying the cardinality restrictions applied to the variable, and allow for active symmetry breaking using ordering constraints. Our contribution includes the formal and practical framework of the new solver implemented on top of a traditional set solver, and an empirical evaluation on benchmark CDPs.