72 citations · 368 across the 79 of their papers we have counts for
Showing 2024 · math.LOShow all
2 papers · 2 filters
math.LO2024
Hereditary First-Order Logic: the tractable quantifier prefix classes
Manuel Bodirsky, Santiago Guzmán-Pro
Many computational problems can be modelled as the class of all finite structures that satisfy a fixed first-order sentence hereditarily, i.e., we require that ever…
math.LO2024
A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
Manuel Bodirsky, Édouard Bonnet, Žaneta Semanišinová
We study the complexity of the valued constraint satisfaction problem (VCSP) for every valued structure with the domain that is preserved by all order-preserving bije…