Discrete Temporal Constraint Satisfaction Problems
classification
🧮 math.LO
cs.CC
keywords
constraintsatisfactiondiscreteproblemtemporalcasecomplexitycomputational
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.