Efficient handling of universally quantified inequalities

DOI10.1007/s10601-008-9053-0zbMath1183.68577OpenAlexW1974614603MaRDI QIDQ1020499

Alexandre Goldsztejn, Claude Michel, Michel Rueher

Publication date: 29 May 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9053-0

zbMATH Keywords

interval analysisbranch and bounduniversally quantified inequalities

Mathematics Subject Classification ID

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

Related Items (4)

Efficient solution of a class of quantified constraints with quantifier prefix exists-forall ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Efficient handling of universally quantified inequalities

Uses Software

• RSOLVER
• AQCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient handling of universally quantified inequalities
• Consistency in networks of relations
• Robust analysis and design of control systems using interval arithmetic
• Nonlinear control system design by quantifier elimination
• Robust multi-objective feedback design by quantifier elimination
• Approximate quantified constraint solving by cylindrical box decomposition
• Guaranteed tuning, with application to robust control and motion planning
• Inner and Outer Approximations of Existentially Quantified Equality Constraints
• Interval Methods for Systems of Equations
• Applying interval arithmetic to real, integer, and boolean constraints
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Efficient handling of universally quantified inequalities