Finite-on-Top-of-Temporal CSPs in Fixed-Point Logic

Manuel Bodirsky, Philipp A. Grzywaczyk

We study definability in fixed-point logic with counting (FPC) for a class of constraint satisfaction problems (CSPs) that simultaneously generalises finite-domain CSPs and tempora…