Constraint satisfaction over connected row-convex constraints

DOI10.1016/S0004-3702(99)00012-0zbMATH Open0916.68061MaRDI QIDQ1292317FDOQ1292317

Authors: Yves Deville, Olivier Barette, Pascal Van Hentenryck 

Publication date: 21 June 1999

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

Recommendations

• Solving connected row convex constraints by variable elimination
• On the minimality and global consistency of row-convex constraint networks
• Constraint satisfaction -- algorithms and complexity analysis
• On the Tractability of Smooth Constraint Satisfaction Problems
• A generic arc-consistency algorithm and its specializations

zbMATH Keywords

consistencyconstraint satisfaction

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (13)

• Properties of tree convex constraints
• The essence of constraint propagation
• Solving connected row convex constraints by variable elimination
• Tractability in constraint satisfaction problems: a survey
• A polynomial relational class of binary CSP
• Constraints, consistency and closure
• Constraint reasoning
• A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property
• Domain permutation reduction for constraint satisfaction problems
• The complexity of reasoning with global constraints
• On restricted disjunctive temporal problems: faster algorithms and tractability frontier
• On tree-preserving constraints
• Disjunctions, independence, refinements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292317)