Abstract
One motivation for introducing constraints in the LP language Prolog was the non-declarative nature of the built-in predicates for arithmetic computations. Therefore, the first CLP languages included constraint solvers for linear polynomial equations and inequations over the real numbers (CLP(ℜ) [33]) or rational numbers (Prolog-III [15], CHIP [20]).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Frühwirth, T., Abdennadher, S. (2003). Linear Polynomial Equations ℜ. In: Essentials of Constraint Programming. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05138-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-05138-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08712-7
Online ISBN: 978-3-662-05138-2
eBook Packages: Springer Book Archive