Author:
Jguirim Wafa,Naanaa Wady,Cooper Martin C.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference24 articles.
1. Bessiere, C., Carbonnel, C., Hebrard, E., Katsirelos, G., Detecting, T.W.: Detecting and exploiting subproblem tractability. In: Rossi, F. (ed.) IJCAI 2013 Proceedings of the 23rd International Joint Conference on Artificial Intelligence. IJCAI/AAAI, Beijing (2013)
2. Bulatov, A.A., Jeavons, P.G., Krokhin, A.A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34, 720–742 (2005)
3. Barto, L., Kozik, M.: Constraint satisfaction problems solvable by local consistency methods. J. ACM 61(1), 3 (2014)
4. Barto, L., Kozik, M., Willard, R.: Near unanimity constraints have bounded pathwidth duality. In: LICS, pp. 125–134. IEEE (2012)
5. Bessière, C., Régin, J.-C., Yap, R.H.C., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165(2), 165–185 (2005)