Antoine Mottet

See also Google Scholar, DBLP, arXiv, ORCID.

Publications in peer-reviewed journals

  1. When symmetries are enough: collapsing the bounded width hierarchy for infinite-domain CSPs.

    Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona.
    To appear in SIAM Journal on Computing. 2024.
    Preprint
  2. Finite Algebras with Hom-Sets of Polynomial Size.

    Libor Barto, Antoine Mottet.
    To appear in Transactions of the American Mathematical Society. 2024.
    Preprint
  3. Complexity Classification Transfer for CSPs via Algebraic Products.

    Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Žaneta Semanišinova.
    To appear in SIAM Journal on Computing. 2024.
    Preprint
  4. When Symmetries are not Enough: a Hierarchy of Hard Constraint Satisfaction Problems.

    Pierre Gillibert, Yannis Jonušas, Michael Kompatscher, Antoine Mottet, Michael Pinsker.
    SIAM Journal on Computing. 2022.
    DOI Preprint
  5. A proof of the algebraic tractability conjecture for Monotone Monadic SNP.

    Manuel Bodirsky, Florent Madelaine, Antoine Mottet.
    SIAM Journal on Computing. 2021.
    DOI Preprint
  6. Cores over Ramsey structures.

    Antoine Mottet, Michael Pinsker.
    Journal of Symbolic Logic. 2021.
    DOI Preprint
  7. $\omega$-categorical structures avoiding height 1 identities.

    Manuel Bodirsky, Antoine Mottet, Mirek Olšák, Jakub Opršal, Michael Pinsker, Ross Willard.
    Transactions of the American Mathematical Society. 2021.
    DOI Preprint
  8. The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata.

    Antoine Mottet, Karin Quaas.
    Theory of Computing Systems. 2021.
    DOI Preprint
  9. Extensions of Unification modulo ACUI.

    Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin.
    Mathematical Structures in Computer Science. 2020.
    DOI (open access)
  10. A Dichotomy for First-Order Reducts of Unary Structures.

    Manuel Bodirsky, Antoine Mottet.
    Logical Methods in Computer Science. 2018.
    DOI (open access)
  11. Discrete Temporal Constraint Satisfaction Problems.

    Manuel Bodirsky, Barnaby Martin, Antoine Mottet.
    Journal of the ACM. 2018.
    DOI Preprint
  12. Distance Constraint Satisfaction Problems.

    Manuel Bodirsky, Victor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker.
    Information and Computation. 2016.
    DOI Preprint

Theses

  • Dichotomies in Constraint Satisfaction: Canonical Functions and Numeric CSPs.

    I have been awarded the Ackermann award 2019 of the European Association for Computer Science Logic for this work.
    PhD thesis.
  • Tractability of Constraint Satisfaction Problems and Projective Clone Homomorphisms.

    Thesis written during the "pre-doctoral year" funded by the École Normale Supérieure of Cachan.
  • A maximally tractable fragment of temporal reasoning plus successor.

    Masters dissertation.

Extended abstracts in conference proceedings

  1. Generalized Completion Problems with Forbidden Tournaments.

    Zeno Bitter, Antoine Mottet.
    To appear in Proceedings of MFCS 2024.
  2. An order out of nowhere: a new algorithm for infinite-domain CSPs.

    Antoine Mottet, Tomáš Nagy, Michael Pinsker.
    In Proceedings of ICALP 2024.
    DOI Preprint
  3. Promise and Infinite-Domain Constraint Satisfaction.

    Antoine Mottet.
    In Proceedings of CSL 2024.
    DOI (open access)
  4. Symmetries of structures that fail to interpret something finite

    Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker.
    In Proceedings of LICS 2023.
    DOI Preprint
  5. Smooth Approximations and CSPs over finitely bounded homogeneous structures.

    Antoine Mottet, Michael Pinsker.
    In Proceedings of LICS 2022.
    DOI Preprint
  6. New Techniques for Universality in Unambiguous Register Automata.

    Wojciech Czerwiński, Antoine Mottet, Karin Quaas.
    In Proceedings of ICALP 2021.
    DOI (open access)
  7. Smooth Approximations and Relational Width Collapses.

    Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michal Wrona.
    In Proceedings of ICALP 2021.
    DOI (open access)
  8. Constraint Satisfaction Problems over Finite Structures.

    Libor Barto, William DeMeo, Antoine Mottet.
    In Proceedings of LICS 2021.
    DOI Preprint
  9. Hrushovski's encoding and $\omega$-categorical CSP monsters.

    Pierre Gillibert, Julius Jonušas, Michael Kompatscher, Antoine Mottet, Michael Pinsker.
    In Proceedings of ICALP 2020.
    DOI (open access)
  10. Topology is relevant (in the dichotomy conjecture for infinite domain constraint satisfaction problems).

    Manuel Bodirsky, Antoine Mottet, Mirek Olšák, Jakub Opršal, Michael Pinsker, Ross Willard.
    In Proceedings of LICS 2019.
    DOI Preprint
  11. The containment problem for Unambiguous Register Automata.

    Antoine Mottet, Karin Quaas.
    In Proceedings of STACS 2019.
    DOI (open access)
  12. The complexity of disjunctive linear Diophantine constraints.

    Manuel Bodirsky, Marcello Mamino, Barnaby Martin, Antoine Mottet.
    In Proceedings of MFCS 2018.
    DOI (open access)
  13. Classification Transfer for Qualitative Reasoning Problems.

    Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet.
    In Proceedings IJCAI 2018.
    DOI (open access)
  14. A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.

    Manuel Bodirsky, Florent Madelaine, Antoine Mottet.
    In Proceedings of LICS 2018.
    DOI Preprint
  15. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.

    Manuel Bodirsky, Antoine Mottet.
    In Proceedings of LICS 2016.
    DOI Preprint
  16. Constraint Satisfaction Problems over the Integers with Successor.

    Manuel Bodirsky, Barnaby Martin, Antoine Mottet.
    In Proceedings of ICALP 2015.
    DOI Preprint