Discrete Temporal Constraint Satisfaction Problems
Manuel Bodirsky, Barnaby D. Martin, Antoine Mottet · Journal of the ACM · 2018
A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) over the set of integers whose constraint language consists of relations that are first-order definable over the order of the integers. We prove that every discrete temporal CSP is in P or NP-complete, unless it can be formulated as a finite domain CSP, in which case the computational complexity is not known in general.