Optimal and efficient filtering algorithms for table constraints

DOI10.1007/s10601-013-9156-0zbMath1328.68201OpenAlexW2092475114MaRDI QIDQ2342592

Yves Deville, Jean-Baptiste Mairy, Pascal Van Hentenryck

Publication date: 29 April 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/282835

zbMATH Keywords

consistencypropagationtable constraintsfiltering algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

From MDD to BDD and arc consistency, STR3: a path-optimal filtering algorithm for table constraints

Uses Software

• OR-tools
• STR2

Cites Work

• Unnamed Item
• Unnamed Item
• STR2: optimized simple tabular reduction for table constraints
• MDD propagators with explanation
• Reformulation of global constraints based on constraints checkers
• An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
• Random constraint satisfaction: easy generation of hard (satisfiable) instances
• A generic arc-consistency algorithm and its specializations
• Partition search for non-binary constraint satisfaction
• Factor Analytic Studies of CSP Heuristics
• Watched Literals for Constraint Propagation in Minion
• Generalized Arc Consistency for Positive Table Constraints
• Global Grammar Constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004