20 citations · 75 across the 44 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2022
Complexity Classification Transfer for CSPs via Algebraic Products
Manuel Bodirsky, Peter Jonsson, Barnaby Martin +2
We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a struc…
math.LO2015
Discrete Temporal Constraint Satisfaction Problems
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) whose constraint language consists of relations that are first-order definable over $…