On the Power of k-Consistency, Proceedings of the 34th International Colloquium on Automata, Languages and Programming, vol.4596, pp.279-290, 2007. ,
Constraint satisfaction problem and universal algebra, ACM SIGLOG News, vol.1, issue.2, pp.14-24, 2014. ,
Constraint Satisfaction Problems Solvable by Local Consistency Methods, Journal of the ACM, vol.61, issue.1, 2014. ,
An optimal coarse-grained arc consistency algorithm, Artif. Intell, vol.165, issue.2, pp.165-185, 2005. ,
Combinatorial problems raised from 2-semilattices, Journal of Algebra, vol.298, pp.321-339, 2006. ,
Bounded relational width. Unpublished manuscript, 2009. ,
A simple algorithm for Mal'tsev constraints, SIAM Journal on Computing, vol.36, issue.1, pp.16-27, 2006. ,
Classifying the Complexity of Constraints using Finite Algebras, SIAM Journal on Computing, vol.34, issue.3, 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
Variable and value elimination in binary constraint satisfaction via forbidden patterns, Journal of Computer and System Sciences, vol.81, issue.7, pp.1127-1143, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01280349
Tractable classes of binary CSPs defined by excluded topological minors, Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'15), pp.1945-1951, 2015. ,
The Complexity of Soft Constraint Satisfaction, Artificial Intelligence, vol.170, issue.11, pp.983-1016, 2006. ,
The tractability of CSP classes defined by forbidden patterns, Journal of Artificial Intelligence Research, vol.45, pp.47-78, 2012. ,
Soft arc consistency revisited, Artificial Intelligence, vol.174, issue.7-8, pp.449-478, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-02662237
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns, Discrete Applied Mathematics, vol.184, pp.89-113, 2015. ,
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination, Artificial Intelligence, vol.174, issue.9, pp.570-584, 2010. ,
A Microstructure-Based Family of Tractable Classes for CSPs, Proceedings of the 21st International Conference on Principles and Practice of 32 COOPER AND?IVNÝ ,
URL : https://hal.archives-ouvertes.fr/hal-01343050
, Constraint Programming (CP'15), vol.9255, pp.74-88
, , 2015.
On broken triangles, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, vol.8656, pp.9-24, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01356058
The power of arc consistency for CSPs defined by partially-ordered forbidden patterns, Proceedings of the 31st Annual ACM/IEE Symposium on Logic in Computer Science (LICS'16), pp.652-661, 2016. ,
Hybrid tractable classes of constraint problems, Complexity and approximability of Constraint Satisfaction Problems, vol.7, pp.113-135, 2017. ,
Linear-time algorithms for testing the realisability of line drawings of curved objects, Artificial Intelligence, vol.108, pp.31-67, 1999. ,
Generalized Majority-Minority Operations are Tractable, Logical Methods in Computer Science, vol.2, issue.4, 2006. ,
Temporal constraint networks, Artif. Intell, vol.49, pp.61-95, 1991. ,
Forbidden Patterns in Constraint Satisfaction Problems, 2014. ,
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory, SIAM Journal on Computing, vol.28, issue.1, pp.57-104, 1998. ,
Hybrid tractable classes of binary quantified constraint satisfaction problems, Proceedings of AAAI'11, 2011. ,
Domain permutation reduction for constraint satisfaction problems, Artificial Intelligence, vol.172, issue.8-9, pp.1094-1118, 2008. ,
The complexity of homomorphism and constraint satisfaction problems seen from the other side, Journal of the ACM, vol.54, issue.1, pp.1-24, 2007. ,
Tractability and learnability arising from algebras with few subpowers, SIAM Journal on Computing, vol.39, issue.7, pp.3023-3037, 2010. ,
Tractable Constraints on Ordered Domains, Artificial Intelligence, vol.79, issue.2, pp.327-339, 1995. ,
Effectiveness of structural restrictions for hybrid csps, 2015. ,
The power of linear programming for general-valued CSPs, SIAM Journal on Computing, vol.44, issue.1, pp.1-36, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01762346
Tractable hypergraph properties for constraint satisfaction and conjunctive queries, Journal of the ACM, vol.60, issue.6 ,
Unifying and extending hybrid tractable classes of CSPs, Journal of Experimental and Theoretical Artificial Intelligence, vol.25, issue.4, pp.407-424, 2013. ,
The Handbook of Constraint Programming, Constraint Propagation, 2006. ,
Hybrid (V)CSPs and algebraic reductions, 2015. ,
The complexity of finite-valued CSPs, Journal of the ACM, vol.63, issue.4 ,
URL : https://hal.archives-ouvertes.fr/hal-01796719