Discrete Temporal Constraint Satisfaction Problems

DOI10.1145/3154832zbMath1425.68135OpenAlexW2962866002MaRDI QIDQ4561495

Antoine Mottet, Manuel Bodirsky, Barnaby Martin

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/23483/1/23483.pdf

zbMATH Keywords

endomorphismsintegerspolymorphismsPresburger arithmeticdiscrete linear orderssuccessor relation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) First-order arithmetic and fragments (03F30)

Related Items (7)

CLAP: A New Algorithm for Promise CSPs ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ Using model theory to find decidable and tractable description logics with concrete domains

This page was built for publication: Discrete Temporal Constraint Satisfaction Problems