References
- BessiereC. and Régin, J. (1997), ‘Arc Consistency for General Constraint Networks: Preliminary Results’, in Proceedings of IJCAI'97, pp. 398–404.
- CooperMC. 1989. An Optimal k-consistency Algorithm. Journal of Artificial Intelligence Research. 41: 89–95.
- CooperMC, CohenDA, JeavonsPG. 1994. Characterizing Tractable Constraints. Journal of Artificial Intelligence Research. 65: 347–361.
- CooperMC, JeavonsPG, SalamonAZ. 2010. Generalizing Constraint Satisfaction on Trees: Hybrid Tractability and Variable Elimination. Journal of Artificial Intelligence Research. 174: 570–584.
- DechterR. 1992. From Local to Global Consistency. Journal of Artificial Intelligence Research. 55: 87–107.
- DechterR. 2003. Constraint Processing. San Francisco, CA: Morgan Kaufmann.
- DechterR, PearlJ. 1987. Network-based Heuristics for Constraint-satisfaction Problems. Journal of Artificial Intelligence Research. 34: 1–38.
- DevilleY. Barette, O., and van Hentenryck, P. (1997), ‘Constraint Satisfaction Over Connected Row Convex Constraints’, in Proceedings of IJCAI-97, Nagoya, Japan, IJCAI Inc, Vol. 1, pp. 405–411.
- FreuderEC. 1982. A Sufficient Condition for Backtrack-free Search. Journal of ACM. 29: 24–32.
- JeavonsPG, CooperMC. 1995. Tractable Constraints on Ordered Domains. Journal of Artificial Intelligence Research. 79: 327–339.
- van BeekP, DechterR. 1995. On the Minimality and Global Consistency of Row-convex Constraint Networks. Journal of ACM. 42: 543–561.
- van BeekP, DechterR. 1997. Constraint Tightness and Looseness Versus Local and Global Consistency. Journal of ACM. 44: 549–566.
- ZhangY. and Yap, R.H.C. (2003), ‘Consistency and Set Intersection’, in Proceedings of IJCAI-03, Acapulco, Mexico, IJCAI Inc, pp. 263–268.
- ZhangY, YapRHC. 2006. Set Intersection and Consistency in Constraint Networks. Journal of Artificial Intelligence Research. 27: 441–464.