An Analysis of Slow Convergence in Interval Propagation

DOI10.1007/978-3-540-74970-7_56MaRDI QIDQ3523087zbMATH OpenOpenAlexFDO

Authors Lucas Bordeaux, Youssef Hamadi, Moshe Y. Vardi

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_56

Mathematics Subject Classification ID

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

Recommendations

• The complexity of integer bound propagation
• An analysis of arithmetic constraints on integer intervals
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 2080550
• Recent Advances in Constraints

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• Accelerating filtering techniques for numeric CSPs
• An analysis of arithmetic constraints on integer intervals
• Applying interval arithmetic to real, integer, and boolean constraints
• Constraint propagation with interval labels
• Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• On the complexity of integer programming
• The essence of constraint propagation
• Theory and practice of constraint handling rules

Cited in

(2)

• Domain reduction techniques for global NLP and MINLP optimization
• The complexity of integer bound propagation

This page was built for publication: An Analysis of Slow Convergence in Interval Propagation

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