Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems
Logic in Computer Science
2021-09-08 v1
Abstract
A temporal (constraint) language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for temporal constraint languages. Our main contribution is a dichotomy for the restricted class of dually-closed temporal languages. We prove that QCSP for such a language is either solvable in polynomial time or it is hard for NP or coNP. Our result generalizes a similar dichotomy of QCSPs for equality languages, which are relational structures definable by Boolean combinations of equalities.
Cite
@article{arxiv.2109.02721,
title = {Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems},
author = {Michał Wrona},
journal= {arXiv preprint arXiv:2109.02721},
year = {2021}
}