Abstract
The idea of approaching hard combinatorial optimization problems through a combination of search and constraint solving appeared first in logic programming. Despite the continued support of logic programming for constraint programmers, research efforts were initiated to import constraint technologies into other paradigms.
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
Corresponding author
Rights and permissions
Copyright information
© 2014 Atlantis Press and the authors
About this chapter
Cite this chapter
Mauro, J. (2014). Constraint Handling Rules. In: Constraints Meet Concurrency. Atlantis Studies in Computing, vol 5. Atlantis Press, Paris. https://doi.org/10.2991/978-94-6239-067-6_4
Download citation
DOI: https://doi.org/10.2991/978-94-6239-067-6_4
Published:
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-6239-066-9
Online ISBN: 978-94-6239-067-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)