Constraint satisfaction problems solvable by local consistency methods, J. ACM, vol.61, issue.1, pp.1-3, 2014. ,
Near unanimity constraints have bounded pathwidth duality, LICS, pp.125-134, 2012. ,
Exploitation de la relation de substituabilité pour la réduction des, CSP. Revue d'Intelligence Artificielle, vol.11, issue.3, pp.249-281, 1997. ,
An optimal coarse-grained arc consistency algorithm, Artif. Intell, vol.165, issue.2, pp.165-185, 2005. ,
Detecting and exploiting subproblem tractability, IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, 2013. ,
Exploiting fixable, removable, and implied values in constraint satisfaction problems, Proceedings of the 11 th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), pp.270-284, 2004. ,
A unifying framework for structural properties of csps: Definitions, complexity, tractability, J. Artif. Intell. Res, vol.32, pp.607-629, 2008. ,
Mal'tsev constraints are tractable, Electronic Colloquium on Computational Complexity (ECCC), issue.34, 2002. ,
Classifying the complexity of constraints using finite algebras, SIAM J. Comput, vol.34, pp.720-742, 2005. ,
Tractability in constraint satisfaction problems: a survey, Constraints, vol.21, issue.2, pp.115-144, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01230685
On singleton arc consistency for csps defined by monotone patterns, the 35 th Symposium on Theoretical Aspects of Computer Science, STACS, vol.19, p.15, 2018. ,
Arc consistency and friends, J. Log. Comput, vol.23, issue.1, pp.87-108, 2013. ,
The complexity of constraint languages, Handbook of Constraint Programming, pp.245-280, 2006. ,
Variable elimination in binary CSP via forbidden patterns, Proceedings of the 23 rd International Joint Conference on Artificial Intelligence (IJCAI), pp.517-523, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01141616
Variable and value elimination in binary constraint satisfaction via forbidden patterns, J. Comput. Syst. Sci, vol.81, issue.7, pp.1127-1143, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01280349
An optimal k-consistency algorithm, Artif. Intell, vol.41, issue.1, pp.89-95, 1989. ,
Hybrid tractable classes of constraint problems, The Constraint Satisfaction Problem: Complexity and Approximability, pp.113-135, 2017. ,
Characterising tractable constraints, Artif. Intell, vol.65, issue.2, pp.347-361, 1994. ,
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination, Artif. Intell, vol.174, issue.9, pp.570-584, 2010. ,
On broken triangles, Proceedings of the 20 th Conference on Principles and Practice of Constraint Programming, pp.9-24, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01095895
A microstructure-based family of tractable classes for CSPs, Proceedings of the 21 st Conference on Principles and Practice of Constraint Programming, pp.74-88, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01343050
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems, Artif. Intell, vol.234, pp.196-218, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01356091
Extending broken triangles and enhanced valuemerging, Proceedings of the 22 nd Conference on Principles and Practice of Constraint Programming, pp.173-188, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01475026
Generalized majority-minority operations are tractable, Logical Methods in Computer Science, vol.2, issue.4, 2006. ,
Constraint processing, 2003. ,
Tree clustering for constraint networks, Artificial Intelligence, pp.353-366, 1989. ,
Constraint satisfaction over connected row convex constraints, Artificial Intelligence, pp.405-411, 1997. ,
Constraint satisfaction over connected row convex constraints, Artif. Intell, vol.109, issue.1-2, pp.243-271, 1999. ,
A BTP-based family of variable elimination rules for binary CSPs, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp.3871-3877, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01785230
A hybrid tractable class for non-binary CSPs, Proceedings of the 25 th International Conference on Tools with Artificial Intelligence, pp.947-954, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01479543
The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput, vol.28, issue.1, pp.57-104, 1998. ,
A sufficient condition for backtrack-free search, J. ACM, vol.29, issue.1, pp.24-32, 1982. ,
A sufficient condition for backtrack-bounded search, J. ACM, vol.32, issue.4, pp.755-761, 1985. ,
Eliminating interchangeable values in constraint satisfaction problems, Proceedings of the 9 th National Conference on Artificial Intelligence, vol.1, pp.227-233, 1991. ,
An efficient implementation of edmonds' algorithm for maximum matching on graphs, J. ACM, vol.23, issue.2, pp.221-234, 1976. ,
A comparison of structural CSP decomposition methods, Artif. Intell, vol.124, issue.2, pp.243-282, 2000. ,
Domain permutation reduction for constraint satisfaction problems, Artif. Intell, vol.172, issue.8-9, pp.1094-1118, 2008. ,
The complexity of homomorphism and constraint satisfaction problems seen from the other side, J. ACM, vol.54, issue.1, pp.1-24, 2007. ,
Independent sets with domination constraints, Discrete Applied Mathematics, vol.99, issue.1-3, pp.39-54, 2000. ,
Tractable constraints on ordered domains, Artif. Intell, vol.79, issue.2, pp.327-339, 1995. ,
Closure properties of constraints, J. ACM, vol.44, issue.4, pp.527-548, 1997. ,
Constraints, consistency and closure, Artif. Intell, vol.101, issue.1-2, pp.251-265, 1998. ,
On the consistency of general constraint-satisfaction problems, Proceedings of the 11 th National Conference on Artificial Intelligence, pp.114-119, 1993. ,
The extendable-triple property: A new CSP tractable class beyond BTP, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp.3746-3754, 2015. ,
On tractability and congruence distributivity, Logical Methods in Computer Science, vol.3, issue.2, 2007. ,
Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977. ,
The existence of a near-unanimity term in a finite algebra is decidable, J. Symb. Log, vol.74, issue.3, pp.1001-1014, 2009. ,
Arc and path consistency revisited, Artif. Intell, vol.28, issue.2, pp.225-233, 1986. ,
URL : https://hal.archives-ouvertes.fr/inria-00548487
Unifying and extending hybrid tractable classes of CSPs, J. Exp. Theor. Artif. Intell, vol.25, issue.4, pp.407-424, 2013. ,
Extending the broken triangle property tractable class of binary CSPs, Proceedings of the 9 th Hellenic Conference on Artificial Intelligence, SETN 2016, vol.3, pp.1-3, 2016. ,
, Proceedings of the 20 th Conference on Principles and Practice of Constraint Programming, vol.8656, 2014.
, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, 2013.
, Handbook of Constraint Programming, vol.2, 2006.
Foundations of constraint satisfaction. Computation in cognitive science, 1993. ,
Constraint tightness and looseness versus local and global consistency, J. ACM, vol.44, issue.4, pp.549-566, 1997. ,
Conditional interchangeability and substitutability, Fourth Intl. Workshop on Symmetry and Constraint Satisfaction Problems-SymCon'04, pp.95-100, 2004. ,
Consistency and set intersection, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp.263-270, 2003. ,
Set intersection and consistency in constraint networks, J. Artif. Intell. Res, vol.27, pp.441-464, 2006. ,