Improving linear constraint propagation by changing constraint representation

DOI10.1023/A:1022323717928MaRDI QIDQ1405334zbMATH OpenOpenAlexFDO

Authors Warwick Harvey, Peter J. Stuckey

Publication date 25 August 2003

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022323717928

zbMATH Keywords

finite domain constraint solvinglinear integer constraintspropagation methods

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Dynamic Analysis of Bounds Versus Domain Propagation
• Propagating systems of dense linear integer constraints
• Propagation via lazy clause generation
• Principles and Practice of Constraint Programming – CP 2004
• Propagation engine prototyping with a domain specific language

Cited in

(13)

• Enhancing numerical constraint propagation using multiple inclusion representations
• An algorithm-independent measure of progress for linear constraint propagation
• View-based propagator derivation
• An analysis of arithmetic constraints on integer intervals
• Exploiting binary floating-point representations for constraint propagation
• Improving IntSat by expressing disjunctions of bounds as linear constraints
• An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
• Dynamic Analysis of Bounds Versus Domain Propagation
• Constraint-Level Advice for Shaving
• A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals
• Revisiting pseudo-Boolean encodings from an integer perspective
• Propagating systems of dense linear integer constraints
• Contraint-based combinators for local search

This page was built for publication: Improving linear constraint propagation by changing constraint representation

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