Constraint Logic Programming
Francesca Rossi, University of Padova, Italy
The limits of my language are the limits of my mind.
All I know is what I have words for.
Ludwig Wittgenstein
In previous chapters we have seen how to solve a given constraint satisfaction problem by means of algorithms that usually employ some form of consistency enforcing combined with some variant of backtracking search. Specific features, like the shape of the constraint graph or the nature of the constraints, can be used to make the search for a solution more efficient, and also to identify tractable classes of constraint problems.
This style of constraint processing provides many techniques and tools to efficiently solve constraint problems. However, ...
Get Constraint Processing 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.
