Antoine Mottet

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 40

Top Topics

Constraint Satisfaction

Reasoning Problems

Constraint Propagation

Top Venues

Publications

Antoine Mottet, Tomás Nagy, Michael Pinsker
An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. ICALP (2024)
Zeno Bitter, Antoine Mottet
Generalized Completion Problems with Forbidden Tournaments. MFCS (2024)
Antoine Mottet
Promise and Infinite-Domain Constraint Satisfaction. CSL (2024)
Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker
Symmetries of structures that fail to interpret something finite. CoRR (2023)
Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker
Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. LICS (2023)
Antoine Mottet, Michael Pinsker, Tomás Nagy
An order out of nowhere: a new algorithm for infinite-domain CSPs. CoRR (2023)
Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. SIAM J. Comput. 51 (2) (2022)
Antoine Mottet, Michael Pinsker
Smooth approximations and CSPs over finitely bounded homogeneous structures. LICS (2022)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
Complexity Classification Transfer for CSPs via Algebraic Products. CoRR (2022)
Libor Barto, William J. DeMeo, Antoine Mottet
Constraint Satisfaction Problems over Finite Structures. LICS (2021)
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
New Techniques for Universality in Unambiguous Register Automata. CoRR (2021)
Antoine Mottet, Michael Pinsker
Cores over Ramsey Structures. J. Symb. Log. 86 (1) (2021)
Antoine Mottet, Karin Quaas
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata. Theory Comput. Syst. 65 (4) (2021)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. 50 (4) (2021)
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
New Techniques for Universality in Unambiguous Register Automata. ICALP (2021)
Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona
Smooth Approximations and Relational Width Collapses. CoRR (2021)
Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona
Smooth Approximations and Relational Width Collapses. ICALP (2021)
Antoine Mottet, Michael Pinsker
Cores over Ramsey structures. CoRR (2020)
Libor Barto, William J. DeMeo, Antoine Mottet
The Complexity of the Homomorphism Problem for Boolean structures. CoRR (2020)
Antoine Mottet, Michael Pinsker
Smooth approximations and CSPs over finitely bounded homogeneous structures. CoRR (2020)
Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
Hrushovski's Encoding and ω-Categorical CSP Monsters. ICALP (2020)
Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin
Extensions of unification modulo ACUI. Math. Struct. Comput. Sci. 30 (6) (2020)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
ω-categorical structures avoiding height 1 identities. CoRR (2020)
Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems. CoRR (2020)
Antoine Mottet, Karin Quaas
On the Containment Problem for Unambiguous Single-Register Automata with Guessing. CoRR (2019)
Antoine Mottet, Karin Quaas
The Containment Problem for Unambiguous Register Automata. STACS (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR (2019)
Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
The complexity of disjunctive linear Diophantine constraints. CoRR (2018)
Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet
Classification transfer for qualitative reasoning problems. CoRR (2018)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR (2018)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS (2018)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet
Classification Transfer for Qualitative Reasoning Problems. IJCAI (2018)
Antoine Mottet, Karin Quaas
The Containment Problem for Unambiguous Register Automata. CoRR (2018)
Manuel Bodirsky, Antoine Mottet
A Dichotomy for First-Order Reducts of Unary Structures. Log. Methods Comput. Sci. 14 (2) (2018)
Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
The Complexity of Disjunctive Linear Diophantine Constraints. MFCS (2018)
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
Discrete Temporal Constraint Satisfaction Problems. J. ACM 65 (2) (2018)
Manuel Bodirsky, Antoine Mottet
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. LICS (2016)
Manuel Bodirsky, Antoine Mottet
A Dichotomy for First-Order Reducts of Unary Structures. CoRR (2016)
Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker
Distance constraint satisfaction problems. Inf. Comput. 247 (2016)
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
Constraint Satisfaction Problems over the Integers with Successor. ICALP (1) (2015)
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
Discrete Temporal Constraint Satisfaction Problems. CoRR (2015)