2000 character limit reached
Discrete Temporal Constraint Satisfaction Problems (1503.08572v3)
Published 30 Mar 2015 in math.LO and cs.CC
Abstract: A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) whose constraint language consists of relations that are first-order definable over $(\Bbb Z,<)$. Our main result says that every distance CSP is in Ptime or NP-complete, unless it can be formulated as a finite domain CSP in which case the computational complexity is not known in general.