Antoine Mottet

According to our database, Antoine Mottet authored at least 32 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures.

Antoine Mottet, Michael Pinsker

J. ACM, October, 2024

Complexity Classification Transfer for CSPs via Algebraic Products.

Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová

SIAM J. Comput., 2024

Generalized Completion Problems with Forbidden Tournaments.

Zeno Bitter, Antoine Mottet

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s.

Antoine Mottet, Tomás Nagy, Michael Pinsker

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Promise and Infinite-Domain Constraint Satisfaction.

Antoine Mottet

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Symmetries of structures that fail to interpret something finite.

Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker

CoRR, 2023

An order out of nowhere: a new algorithm for infinite-domain CSPs.

Antoine Mottet, Michael Pinsker, Tomás Nagy

CoRR, 2023

Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing.

Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems.

Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker

SIAM J. Comput., 2022

Smooth approximations and CSPs over finitely bounded homogeneous structures.

Antoine Mottet, Michael Pinsker

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP.

Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet

SIAM J. Comput., 2021

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata.

Antoine Mottet, Karin Quaas

Theory Comput. Syst., 2021

Cores over Ramsey Structures.

Antoine Mottet, Michael Pinsker

J. Symb. Log., 2021

Constraint Satisfaction Problems over Finite Structures.

Libor Barto, William J. DeMeo, Antoine Mottet

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Smooth Approximations and Relational Width Collapses.

Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

New Techniques for Universality in Unambiguous Register Automata.

Wojciech Czerwinski, Antoine Mottet, Karin Quaas

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Extensions of unification modulo ACUI.

Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin

Math. Struct. Comput. Sci., 2020

The Complexity of the Homomorphism Problem for Boolean structures.

Libor Barto, William J. DeMeo, Antoine Mottet

CoRR, 2020

ω-categorical structures avoiding height 1 identities.

Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard

CoRR, 2020

Hrushovski's Encoding and ω-Categorical CSP Monsters.

Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

On the Containment Problem for Unambiguous Single-Register Automata with Guessing.

Antoine Mottet, Karin Quaas

CoRR, 2019

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).

Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard

CoRR, 2019

The Containment Problem for Unambiguous Register Automata.

Antoine Mottet, Karin Quaas

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).

Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

A Dichotomy for First-Order Reducts of Unary Structures.

Manuel Bodirsky, Antoine Mottet

Log. Methods Comput. Sci., 2018

Discrete Temporal Constraint Satisfaction Problems.

Manuel Bodirsky, Barnaby Martin, Antoine Mottet

J. ACM, 2018

The Complexity of Disjunctive Linear Diophantine Constraints.

Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.

Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Classification Transfer for Qualitative Reasoning Problems.

Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2016

Distance constraint satisfaction problems.

Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker

Inf. Comput., 2016

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

Manuel Bodirsky, Antoine Mottet

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Constraint Satisfaction Problems over the Integers with Successor.

Manuel Bodirsky, Barnaby Martin, Antoine Mottet

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015