Discrete temporal constraint satisfaction problems

Publikationstyp
Conference Paper
Date Issued
2018-02
Sprache
English
Author(s)
Bodirsky, Manuel  
Martin, Barnaby  
Mottet, Antoine  
TORE-URI
http://hdl.handle.net/11420/12092
Journal
Journal of the ACM  
Volume
65
Issue
2
Article Number
9
Citation
Journal of the ACM 65 (2): 9 (2018-02)
Publisher DOI
10.1145/3154832
Scopus ID
2-s2.0-85041730021
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.
Subjects
Discrete linear orders
Endomorphisms
Integers
Polymorphisms
Presburger arithmetic
Successor relation