Propagating systems of dense linear integer constraints

DOI10.1007/S10601-008-9049-9MaRDI QIDQ842789zbMATH OpenOpenAlexFDO

Authors Thibaut Feydy, Peter J. Stuckey

Publication date 25 September 2009

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-008-9049-9

zbMATH Keywords

interval arithmeticGauss-Jordan eliminationconstraint propagationlinear constraintsFourier elimination

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1222422
• Linear dynamical systems with integer constraints
• Computational complexity of linear constraints over the integers
• scientific article; zbMATH DE number 14318
• An efficient representation for linear constraints
• QUALITATIVE PROPERTIES OF SYSTEMS OF LINEAR CONSTRAINTS
• Linear programs for constraint satisfaction problems
• scientific article; zbMATH DE number 3912102
• scientific article; zbMATH DE number 7124428

Cites work

• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• An interval Newton method
• Improving linear constraint propagation by changing constraint representation
• Interval Methods for Systems of Equations
• Propagating systems of dense linear integer constraints

Cited in

(4)

• Propagating systems of dense linear integer constraints
• Improving linear constraint propagation by changing constraint representation
• An analysis of arithmetic constraints on integer intervals
• Recent Advances in Constraints

Describes a project that uses

Uses Software

• Mercury
• gaol
• CPLEX

This page was built for publication: Propagating systems of dense linear integer constraints

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