Generalized Arc Consistency for Positive Table Constraints

DOI10.1007/11889205_22zbMath1335.90096OpenAlexW1507924438MaRDI QIDQ3524245

Christophe Lecoutre, Radoslaw Szymanek

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_22

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (12)

Strong local consistency algorithms for table constraints ⋮ STR2: optimized simple tabular reduction for table constraints ⋮ Dealing with satisfiability and \(n\)-ary CSPs in a logical framework ⋮ Generating custom propagators for arbitrary constraints ⋮ Domain consistency with forbidden values ⋮ Reformulating table constraints using functional dependencies-an application to explanation generation ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ Random constraint satisfaction: easy generation of hard (satisfiable) instances ⋮ STR3: a path-optimal filtering algorithm for table constraints ⋮ Optimal and efficient filtering algorithms for table constraints

This page was built for publication: Generalized Arc Consistency for Positive Table Constraints