Discrete Temporal Constraint Satisfaction Problems
Manuel Bodirsky, Barnaby Martin, and Antoine Mottet
TL;DR
This paper classifies the computational complexity of discrete temporal constraint satisfaction problems, showing they are either solvable in polynomial time or NP-complete, with some cases remaining unresolved.
Contribution
It provides a dichotomy classification for distance CSPs, identifying conditions under which they are tractable or NP-complete.
Findings
Distance CSPs are in P or NP-complete.
Unresolved complexity for some finite domain formulations.
Main result extends understanding of temporal CSP complexity.
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 . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.