Applying interval arithmetic to real, integer, and boolean constraints
From MaRDI portal
Publication:4352540
DOI10.1016/S0743-1066(96)00142-2zbMath0882.68032MaRDI QIDQ4352540
William J. Older, Frédéric Benhamou
Publication date: 4 September 1997
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (32)
Algorithmic differentiation techniques for global optimization in the COCONUT environment ⋮ On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP ⋮ Constraint propagation as information maximization ⋮ The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information ⋮ From chaotic iteration to constraint propagation ⋮ Constraint propagation on quadratic constraints ⋮ SUSPECT: MINLP special structure detector for Pyomo ⋮ \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton} ⋮ Solving linear, min and max constraint systems using CLP based on relational interval arithmetic ⋮ Stability analysis of discrete-time switched systems via multi-step multiple Lyapunov-like functions ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ A global constraint for over-approximation of real-time streams ⋮ An Analysis of Slow Convergence in Interval Propagation ⋮ Solving kinematics problems by efficient interval partitioning ⋮ The essence of constraint propagation ⋮ An analysis of arithmetic constraints on integer intervals ⋮ On a decision procedure for quantified linear programs ⋮ Reverse propagation of McCormick relaxations ⋮ Interval constraint propagation with application to bounded-error estimation ⋮ A new framework for sharp and efficient resolution of NCSP with manifolds of solutions ⋮ A branch and bound algorithm for numerical Max-CSP ⋮ Safe and tight linear estimators for global optimization ⋮ Efficient handling of universally quantified inequalities ⋮ A gentle introduction to Numerica ⋮ Tightened reachability constraints for the verification of linear hybrid systems ⋮ Local consistency for extended CSPs ⋮ Enhancing numerical constraint propagation using multiple inclusion representations ⋮ Interval propagation and search on directed acyclic graphs for numerical constraint solving ⋮ A class of polynomially solvable range constraints for interval analysis without widenings ⋮ Accelerating filtering techniques for numeric CSPs ⋮ Interval analysis on directed acyclic graphs for global optimization ⋮ Combining slicing and constraint solving for validation of measurement software
This page was built for publication: Applying interval arithmetic to real, integer, and boolean constraints
