The tractability of CSP classes defined by forbidden patterns, Journal of Artificial Intelligence Research, vol.45, pp.47-78, 2012. ,
Variable elimination in binary CSP via forbidden patterns, Proceedings of IJCAI, pp.517-523, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01141616
Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Artificial Intelligence, vol.90, issue.12, pp.1-24, 1997. ,
A dichotomy for 2-constraint forbidden CSP patterns, Proceedings of AAAI, pp.464-470, 2012. ,
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination, Artificial Intelligence, vol.174, pp.9-10, 2010. ,
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation, Journal of Artificial Intelligence Research, vol.44, pp.455-490, 2012. ,
Effective Preprocessing in SAT Through Variable and Clause Elimination, Proceedings of SAT, pp.61-75, 2005. ,
A hybrid tractable class for non-binary CSPs, Proceedings of ICTAI, pp.947-954, 2013. ,
DOI : 10.1007/s10601-015-9185-y
Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems, Proceedings of AAAI, pp.731-736, 1993. ,
Eliminating interchangeable values in constraint satisfaction problems, Proceedings of AAAI, pp.227-233, 1991. ,
Eliminating redundancy in CSPs through merging and subsumption of domain values, ACM SIGAPP Applied Computing Review, vol.13, issue.2, p.2013 ,
DOI : 10.1145/2505420.2505422
Perfect Constraints Are Tractable, Proceedings of CP, pp.524-528, 2008. ,