Year: 2026
Type: preprint
Abstract: 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 temporal CSPs. The templates for the CSPs are first-order expansions of the structure $([k] \times {\mathbb Q};<_1,\dots,<_k,\sim)$ where $<_i \, := \{((i,x),(i,x')) \mid x
Source: arXiv (Cornell University)
Authors: Bodirsky, Manuel, Grzywaczyk, Philipp A.
Institution: Technische Universität Dresden
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: European Commission
Award: G1304993860
OpenAlex ID: W7221753611