Revisiting global constraint satisfaction

DOI10.1016/S0020-0190(98)00023-4zbMath0925.68195MaRDI QIDQ1129109

Walter Hower

Publication date: 13 August 1998

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitycombinatorial problemsconstraint satisfactionanalysis/design of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (3)

\textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Revisiting global constraint satisfaction ⋮ Constraint updating

Cites Work

• Constraint satisfaction -- algorithms and complexity analysis
• Constraint satisfaction from a deductive viewpoint
• An optimal k-consistency algorithm
• Revisiting global constraint satisfaction
• From local to global consistency
• Exploiting the deep structure of constraint problems
• Local and global relational consistency
• An Average Time Analysis of Backtracking
• Estimating the Efficiency of Backtrack Programs
• Synthesizing constraint expressions
• Avoiding Cartesian products for multiple joins
• Fine-grained conflict resolution in constraint satisfaction problems
• Generalized constraint propagation over the CLP scheme
• Tractable constraints on ordered domains

This page was built for publication: Revisiting global constraint satisfaction