Abstract
The paper gives a very informal overview of the main results in the area of finite domain constraint satisfaction problems (CSPs). Particular attention is put into the description of local consistency algorithms, which efficiently solve some classes of constraint problems, and of the relationship between CSPs and logic programming. In fact, logic programming, as well as some other language paradigms which were born to extend logic programming (like constraint logic programming and concurrent constraint logic programming) seems to be very suitable to naturally represent and solve CSPs, and also to use them to provide a general notion of computing with constraints.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
