Constraint satisfaction problem and universal algebra, ACM SIGLOG News, vol.1, issue.2, pp.14-24, 2014. ,
Give me another one!, Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC-2015), pp.664-676, 2015. ,
As close as it gets, Proceedings of the 10th International Workshop on Algorithms and Computation (WALCOM-2016), pp.222-235, 2016. ,
A model-theoretic view on qualitative constraint reasoning, Journal of Artificial Intelligence Research, vol.58, pp.339-385, 2017. ,
Partition into triangles on bounded degree graphs. Theory of Computing Systems, vol.52, pp.687-718, 2013. ,
Galois theory for Post algebras, I. Cybernetics, vol.5, pp.243-252, 1969. ,
Galois theory for Post algebras, II. Cybernetics, vol.5, pp.531-539, 1969. ,
Maximal partial clones with no finite basis. Algebra Universalis, vol.40, pp.453-476, 1998. ,
A dichotomy theorem for nonuniform CSPs, Proceedings of the 58th Annual Symposium on Foundations of Computer Science (FOCS-2017), 2017. ,
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. ,
The complexity of satisfiability of small depth circuits, Parameterized and Exact Computation, vol.5917, pp.75-85, 2009. ,
Intersections of finitely generated maximal partial clones. Multiple-Valued Logic and Soft Computing, vol.19, pp.85-94, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01090584
On the interval of Boolean strong partial clones containing only projections as total operations, Proceedings of the 47th International Symposium on Multiple-Valued Logic, pp.88-93, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01504012
Partial clones containing all boolean monotone self-dual partial functions. Multiple-Valued Logic and Soft Computing, vol.27, pp.183-192, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01093942
Journal of Multiple-Valued Logic and Soft Computing ,
A solution to a problem of D. Lau: Complete classification of intervals in the lattice of partial boolean clones. Multiple-Valued Logic and Soft Computing, vol.28, pp.47-58, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01090640
A dichotomy theorem for maximum generalized satisfiability problems, Journal of Computer and System Sciences, vol.51, issue.3, pp.511-522, 1995. ,
A survey of qualitative spatial and temporal calculi: Algebraic and computational properties, ACM Computing Surveys, vol.50, issue.1, 2017. ,
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. ,
Closed systems of functions and predicates, Pacific Journal of Mathematics, vol.27, issue.1, pp.95-100, 1968. ,
On the complexity of k-SAT, Journal of Computer and System Sciences, vol.62, issue.2, pp.367-375, 2001. ,
On the algebraic structure of combinatorial problems, Theoretical Computer Science, vol.200, pp.185-204, 1998. ,
Closure properties of constraints, Journal of the ACM, vol.44, issue.4, pp.527-548, 1997. ,
Strong partial clones and the time complexity of SAT problems, Journal of Computer and System Sciences, vol.84, pp.52-78, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01711768
Time complexity of constraint satisfaction via universal algebra, Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS-2017), vol.17, p.15, 2017. ,
Weak bases of Boolean co-clones, Information Processing Letters, vol.114, issue.9, pp.462-468, 2014. ,
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT, Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016), vol.58, pp.1-64, 2016. ,
A dichotomy theorem for the inverse satisfiability problem, Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol.93, pp.39-39, 2018. ,
Which NP-hard SAT and CSP problems admit exponentially improved algorithms? CoRR, 2018. ,
Function Algebras on Finite Sets: Basic Course on ManyValued Logic and Clone Theory ,
Funktionen-und Relationenalgebren, 1979. ,
The two-valued iterative systems of mathematical logic, Annals of Mathematical Studies, vol.5, pp.1-122, 1941. ,
The algebras of partial functions and their invariants, Cybernetics, vol.17, issue.2, pp.157-167, 1981. ,
The complexity of satisfiability problems, Proceedings of the 10th Annual ACM Symposium on Theory Of Computing (STOC-78), pp.216-226, 1978. ,
Enumerating all solutions for constraint satisfaction problems, Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS-2007), vol.4393, pp.694-705, 2007. ,
Partial polymorphisms and constraint satisfaction problems, Complexity of Constraints, vol.5250, pp.229-254, 2008. ,
The weak base method for constraint satisfaction, 2008. ,
Dichotomy on intervals of strong partial Boolean clones, Algebra Universalis, vol.73, issue.3-4, pp.347-368, 2015. ,
A probabilistic algorithm for k-sat and constraint satisfaction problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-1999), p.410, 1999. ,
Algorithms, measures and upper bounds for satisfiability and related problems, 2007. ,
The proof of CSP dichotomy conjecture, Proceedings of the 58th Annual Symposium on Foundations of Computer Science (FOCS-2017), 2017. ,