Discrete Temporal Constraint Satisfaction Problems
Logic
2016-04-27 v3 Computational 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.
Cite
@article{arxiv.1503.08572,
title = {Discrete Temporal Constraint Satisfaction Problems},
author = {Manuel Bodirsky and Barnaby Martin and Antoine Mottet},
journal= {arXiv preprint arXiv:1503.08572},
year = {2016}
}
Comments
41 pages