Antoine Mottet
See also
Google Scholar,
DBLP,
arXiv,
ORCID.
An order out of nowhere: a new algorithm for
infinite-domain CSPs.
With Tomáš Nagy, Michael Pinsker.
Submitted. Preprint
Finite Algebras with Hom-Sets of Polynomial Size.
With Libor Barto.
Submitted. Preprint
Complexity Classification Transfer for CSPs via Algebraic Products.
With Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Žaneta Semanišinova.
Submitted. Extended and corrected version of the extended abstract that appeared at IJCAI 2018. Preprint
When symmetries are enough: collapsing the bounded width hierarchy for infinite-domain CSPs.
With Tomáš Nagy, Michael Pinsker, Michał Wrona.
Submitted. Journal version of the extended abstract that appeared at ICALP 2021. Preprint
Smooth Approximations: an Algebraic Approach to CSPs over finitely bounded homogeneous structures.
With Michael Pinsker.
Submitted. Journal version of the extended abstract that appeared at LICS 2022. Preprint
Publications in peer-reviewed journals
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
A proof of the algebraic tractability conjecture for Monotone Monadic SNP.
Manuel Bodirsky, Florent Madelaine, Antoine Mottet.
SIAM Journal on Computing. 2021.
DOI Preprint
Cores over Ramsey structures.
Antoine Mottet, Michael Pinsker.
Journal of Symbolic Logic. 2021.
DOI Preprint
$\omega$-categorical structures avoiding height 1 identities.
Manuel Bodirsky, Antoine Mottet, Mirek Olšák, Jakub Opršal, Michael Pinsker, Ross Willard.
Transactions of the AMS. 2021.
DOI Preprint
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata.
Antoine Mottet, Karin Quaas.
Theory of Computing Systems. 2021.
DOI Preprint
Extensions of Unification modulo ACUI.
Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin.
Mathematical Structures in Computer Science. 2020.
DOI (open access)
A Dichotomy for First-Order Reducts of Unary Structures.
Manuel Bodirsky, Antoine Mottet.
Logical Methods in Computer Science. 2018.
DOI (open access)
Discrete Temporal Constraint Satisfaction Problems.
Manuel Bodirsky, Barnaby Martin, Antoine Mottet.
Journal of the ACM. 2018.
DOI
Preprint
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
Promise and Infinite-Domain Constraint Satisfaction.
To appear in Proceedings of CSL 2024.
Symmetries of structures that fail to interpret something finite
With Libor Barto, Bertalan Bodor, Marcin Kozik, and Michael Pinsker.
In Proceedings of LICS 2023.
DOI Preprint
Smooth Approximations and CSPs over finitely bounded homogeneous structures.
Antoine Mottet, Michael Pinsker.
In Proceedings of LICS 2022.
DOI Preprint
New Techniques for Universality in Unambiguous Register Automata.
Wojciech Czerwiński, Antoine Mottet, Karin Quaas.
In Proceedings of ICALP 2021.
DOI (open access)
Smooth Approximations and Relational Width Collapses.
Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michal Wrona.
In Proceedings of ICALP 2021.
DOI (open access)
Constraint Satisfaction Problems over Finite Structures.
Libor Barto, William DeMeo, Antoine Mottet.
In Proceedings of LICS 2021.
DOI Preprint
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)
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
-
The containment problem for Unambiguous Register Automata.
Antoine Mottet, Karin Quaas.
In Proceedings of STACS 2019.
DOI (open access)
The complexity of disjunctive linear Diophantine constraints.
Manuel Bodirsky, Marcello Mamino, Barnaby Martin, Antoine Mottet.
In Proceedings of MFCS 2018.
DOI (open access)
Classification Transfer for Qualitative Reasoning Problems.
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet.
In Proceedings IJCAI 2018.
DOI (open access)
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
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
Constraint Satisfaction Problems over the Integers with Successor.
Manuel Bodirsky, Barnaby Martin, Antoine Mottet.
In Proceedings of ICALP 2015.
DOI
Preprint