Principles of Constraint Programming: Constraint propagation algorithms

摘要: THE ALGORITHMS THAT achieve local consistency are called constraint propagation algorithms. In the literature, perhaps to confuse newcomers entering field, several other names have also been used. fact, we found following alternative for these algorithms: consistency, propagation, enforcing, Waltz, filtering and narrowing The aim of this chapter is discuss various These algorithms form a crucial ingredient generic procedure Solve Figure 3.1 from Section 3.2 that can be used solve given CSP. Sometimes CSP already solved solely by means algorithm. Examples furnished some results proved in Chapter 5, namely Consistency 2 Theorem 5.48, Directional Arc 5.49, Path 5.50. Another example provided crossword puzzle Example 2.8. We saw at end 5.2 represents transforming it an equivalent arc consistent So turned out sufficient find solution When introducing 5 notions characterised them proof rules theoretic framework 4.1. Also 6 defined incomplete solvers using rules.