Revisiting global constraint satisfaction

DOI10.1016/S0020-0190(98)00023-4MaRDI QIDQ1129109zbMATH OpenFDO

Authors Walter Hower

Publication date 13 August 1998

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

zbMATH Keywords

computational complexityconstraint satisfactioncombinatorial problemsanalysis/design of algorithms

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

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

This page was built for publication: Revisiting global constraint satisfaction

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