Abstract
Given three intervals a, b, c in the real numbers and the multiplication constraint z = xy ∧ x ∈a ∧ x ∈b ∧x ∈ c, we are interested in establishing and justifying formulas for computing the smallest intervals a, b, c which substituted for a, b, c do not modify the set of solutions of the constraint.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colmerauer, A. (2001). Solving the Multiplication Constraint in Several Approximation Spaces. In: Codognet, P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45635-X_1
Download citation
DOI: https://doi.org/10.1007/3-540-45635-X_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42935-7
Online ISBN: 978-3-540-45635-3
eBook Packages: Springer Book Archive