Abstract
Several constraint satisfaction algorithms focus on numeric constraint satisfaction problems (CSPs). A numeric CSP is defined by a set of variables, their domains, intervals in \(\mathcal R\), and the set of constraints, expressed as mathematical relations, which must be satisfied for any solution. Such CSPs can model many engineering and design problems from domains such as mechanical, electrical and civil engineering.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Faltings, B.V., Gelle, E.M.: Local consistency for ternary numeric constraints. In: Internation Joint Conference on Artificial Intelligence (IJCAI), vol. 1, pp. 392–397 (1997)
Lhomme, O.: Consistency techniques for numerical CSPs. In: Internation Joint Conference on Artificial Intelligence (IJCAI), vol. 1, pp. 232–238 (1993)
Sam-Haroud, D.: Constraint Consistency Techniques for Continuous Domains. Phdthesis no. 1826. Swiss Federal Institute of Technology in Lausanne, Switzerland (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lottaz, C. (1999). Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive