Dynamic Analysis of Bounds Versus Domain Propagation

DOI10.1007/978-3-540-89982-2_32zbMATH Open1185.68232OpenAlexW1480069013MaRDI QIDQ5504665FDOQ5504665

Authors: Christian Schulte, Peter J. Stuckey 

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_32

Recommendations

• Improving linear constraint propagation by changing constraint representation
• When is it worthwhile to propagate a constraint? A probabilistic analysis of \textsc{AllDifferent}
• Principles and Practice of Constraint Programming – CP 2004
• Generalized support and formal development of constraint propagators
• Heuristics for dynamically adapting propagation in constraint satisfaction problems

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Consistency in networks of relations

Cited In (6)

• The extended global cardinality constraint: an empirical survey
• Improving linear constraint propagation by changing constraint representation
• Understanding the potential of propagators
• Principles and Practice of Constraint Programming – CP 2004
• Heuristics for dynamically adapting propagation in constraint satisfaction problems
• The complexity of integer bound propagation

Uses Software

• Gecode

This page was built for publication: Dynamic Analysis of Bounds Versus Domain Propagation

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