An algorithm to compute inner approximations of relations for interval constraints

DOI10.1007/3-540-46562-6_37MaRDI QIDQ2729954zbMATH OpenFDO

Authors Frédéric Benhamou, Frédéric Goualard, Éric Languénou, Marc Christie

Publication date 23 October 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46562-6_37

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2080299
• Interval constraint solving for camera control and motion planning
• Approximate quantified constraint solving by cylindrical box decomposition
• Algorithmic power from declarative use of redundant constraints
• Inner and Outer Approximations of Existentially Quantified Equality Constraints

Cited in

(10)

• Constraint reasoning based on interval arithmetic: The tolerance propagation approach
• Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
• A class of polynomially solvable range constraints for interval analysis without widenings
• scientific article; zbMATH DE number 4163459 (Why is no real title available?)
• Inner and Outer Approximations of Existentially Quantified Equality Constraints
• scientific article; zbMATH DE number 683340 (Why is no real title available?)
• scientific article; zbMATH DE number 1975073 (Why is no real title available?)
• scientific article; zbMATH DE number 2080299 (Why is no real title available?)
• Interval constraint solving for camera control and motion planning
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: An algorithm to compute inner approximations of relations for interval constraints

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