作者: Ugo Montanari , Francesca Rossi
DOI: 10.1007/978-3-662-02952-7_4
关键词: Functional logic programming 、 Constraint satisfaction problem 、 Mathematical optimization 、 Constraint logic programming 、 Mathematics 、 Constraint satisfaction 、 Constraint programming 、 Inductive programming 、 Logic programming 、 Theoretical computer science 、 Concurrent constraint logic programming
摘要: The paper gives a very informal overview of the main results in area finite domain constraint satisfaction problems (CSPs). Particular attention is put into description local consistency algorithms, which efficiently solve some classes problems, and relationship between CSPs logic programming. In fact, programming, as well other language paradigms were born to extend programming (like concurrent programming) seems be suitable naturally represent CSPs, also use them provide general notion computing with constraints.