From simple filtering to tagging
- 119 Downloads
In the previous sections, we discussed filtering algorithms for dynamic constraint networks. We started with a simple filtering algorithm for computing local consistency and introduced an extension of filtering to use it as a general constraint satisfaction algorithm. In contrast to a backtracking approach, filtering combined with tagging is a kind of breadth-first method for solving dynCSPs. Although it is more expensive to compute all solutions instead of looking for one tuple that satisfies the constraints, this makes sense, as many dynCPs have a huge search space but only a few solutions.
KeywordsDynamic Network Dynamic Constraint Constraint Network Simple Filter Local Consistency
Unable to display preview. Download preview PDF.