Foundations of Artificial Intelligence, Vol. 2, Suppl. (C), 2006
ISSN: 1574-6526
doi: 10.1016/S1574-6526(06)80006-4
Chapter 2 Constraint Satisfaction: An Emerging Paradigm
This chapter focuses on the emergence of constraint satisfaction, with constraint languages, as a new paradigm within artificial intelligence and computer science during the period from 1965 (when Golomb and Baumert published “Backtrack programming” [34]) to 1985 (when Mackworth and Freuder published “The complexity of some polynomial network consistency algorithms for constraint satisfaction problems” [55]). The rest of this handbook will cover much of the material introduced here in more detail, as well as, of course, continuing on ...
Get Handbook of Constraint Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
