Constraint satisfaction over connected row-convex constraints

DOI10.1016/S0004-3702(99)00012-0zbMath0916.68061MaRDI QIDQ1292317

Yves Deville, Pascal Van Hentenryck, Olivier Barette

Publication date: 21 June 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

consistencyconstraint satisfaction

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (12)

Disjunctions, independence, refinements ⋮ Tractability in constraint satisfaction problems: a survey ⋮ Solving connected row convex constraints by variable elimination ⋮ A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property ⋮ Domain permutation reduction for constraint satisfaction problems ⋮ Properties of tree convex constraints ⋮ On tree-preserving constraints ⋮ The essence of constraint propagation ⋮ The complexity of reasoning with global constraints ⋮ A polynomial relational class of binary CSP ⋮ On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier ⋮ Constraints, consistency and closure

This page was built for publication: Constraint satisfaction over connected row-convex constraints