# Antoine Mottet

Since September 2015, I am a doctoral student enrolled in the QuantLA doctoral program and
working at the institute of algebra at the Technische Universität Dresden under the supervision of
Manuel Bodirsky.

I am currently working on decision problems
that can be formulated as constraint satisfaction problems over an infinite domain. More specifically, I am focussing on constraint satisfaction problems over the integers and whose constraint languages can be formulated in first-order arithmetic.
These problems come from various areas of computer science, such as artificial intelligence or verification.
The methods involved in the study of these problems
come from
several areas of mathematics such as universal algebra, topology, model theory, and Ramsey theory.

# Publications

###### A Dichotomy for First-Order Reducts of Unary Structures.

Manuel Bodirsky, Antoine Mottet.

Submitted.

Preprint Bibtex

@unpublished{BodirskyMottet-UnaryStructures, author = {Bodirsky, Manuel and Mottet, Antoine}, title = {{A Dichotomy for First-Order Reducts of Unary Structures}}, year = {2017}, note = {Submitted} }

###### Discrete Temporal Constraint Satisfaction Problems.

Manuel Bodirsky, Barnaby Martin, Antoine Mottet.

Accepted for publication in the Journal of the ACM.

Preprint Bibtex

@article{BodirskyMartinMottet-DiscreteTemporal, author = {Bodirsky, Manuel and Martin, Barnaby and Mottet, Antoine}, journal = {Journal of the ACM}, title = {{Discrete Temporal Constraint Satisfaction Problems}}, year = {2017}, note = {Accepted for publication in the Journal of the ACM.} }

###### Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.

Manuel Bodirsky, Antoine Mottet.

In*Proceedings of the 31st Annual Symposium of Logic in Computer Science (LICS).*2016.

DOI Preprint Bibtex

@inproceedings{BodirskyMottet-LICS2016, author = {Bodirsky, Manuel and Mottet, Antoine}, title = {{Reducts of Finitely Bounded Homogeneous Structures, and Lifting Tractability from Finite-Domain Constraint Satisfaction}}, year = {2016}, pages = {623--632}, doi = {http://dx.doi.org/10.1145/2933575.2934515}, booktitle = {Proceedings of the 31st annual symposium of logic in computer science (LICS)} }

###### Constraint Satisfaction Problems over the Integers with Successor.

Manuel Bodirsky, Barnaby Martin, Antoine Mottet.

In*Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP).*2015.

DOI Preprint Bibtex

@inproceedings{BodirskyMartinMottet-ICALP2015, author = {Bodirsky, Manuel and Martin, Barnaby and Mottet, Antoine}, title = {{Constraint Satisfaction Problems over the Integers with Successor}}, year = {2015}, pages = {256--267}, series = {LNCS}, volume = {9134}, doi = {10.1007/978-3-662-47672-7_21}, booktitle = {Proceedings of the 42nd International colloquium on automata, languages and programming (ICALP)} }

###### Distance Constraint Satisfaction Problems.

Manuel Bodirsky, Victor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker.

*Information and Computation*. 2016.

DOI Preprint Bibtex

@article{BodirskyDalmauMartinMottetPinsker-InfComp2016, author = {Bodirsky, Manuel and Dalmau, V\'ictor and Martin, Barnaby and Mottet, Antoine and Pinsker, Michael}, title = {{Distance Constraint Satisfaction Problems}}, year = {2016}, journal = {{Information and Computation}}, volume = {247}, pages = {87--105}, doi = {http://dx.doi.org/10.1016/j.ic.2015.11.010} }

# Seminars, conferences, workshops

Future events:- 03-08/06/18: The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar.

- 07/11/17: Introduction to Constraint Satisfaction Problems.

QuantLA seminar, Leipzig. - 18-22/09/17: QuantLA Workshop, Altenberg.
- 01/09/17: Proof of Universal-Algebraic Dichotomy Conjecture for MMSNP. International Seminar of the Institute of Algebra, TU Dresden.
- 19/06/17: Discrete Temporal Constraint Satisfaction Problems. Slides

Workshop on Logic and Computational Complexity, Reykjavik. - 12-14/06/17: 11th Joint Workshop of the German Research Training in Computer Science.
- 22/03/17: The universal-algebraic approach to constraint satisfaction for countable saturated structures.

KAFKA seminar, Charles University, Prague. - 09/11/16: Canonical functions and constraint satisfaction. Slides Video

Workshop {Symmetry, Logic, Computation}, Simons Institute, Berkeley. - 19/09/16: Reasoning with discrete time. Slides

QuantLA Workshop, Krippen. - 07/07/16: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.

31st Annual Symposium of Logic in Computer Science (LICS16), New-York. - 11/05/16: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.
Slides

PhDs in Logic VIII, Darmstadt. - 26/04/16: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. Slides

QuantLA seminar, Dresden. - 04/12/15: Mashup algebras and constraint satisfaction problems.

Seminar of the institute of algebra, Dresden. - 06/07/15: Constraint Satisfaction Problems over the Integers with Successor. Slides

42nd International Colloquium on Automata, Languages and Programming (ICALP15), Kyoto.

# Other things

- Has P vs. NP been solved? (by Scott Aaronson)
- Tractability of Constraint Satisfaction Problems and Projective Clone Homomorphisms. Link
- An interactive illustration of mean-payoff games.