Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems

09/06/2021
by   Michał Wrona, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/23/2021

Tractability of Quantified Temporal Constraints To The Max

A temporal constraint language is a set of relations that are first-orde...
12/10/2020

Tractable Combinations of Temporal CSPs

The constraint satisfaction problem (CSP) of a first-order theory T is t...
10/18/2021

The complexity of the Quantified CSP having the polynomially generated powers property

It is known that if an algebra of polymorphisms of the constraint langua...
04/26/2011

Arc Consistency and Friends

A natural and established way to restrict the constraint satisfaction pr...
12/02/2020

Tractable Combinations of Theories via Sampling

For a first-order theory T, the Constraint Satisfaction Problem of T is ...
03/02/2014

Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction

We consider the quantified constraint satisfaction problem (QCSP) which ...
07/18/2019

Approximate counting CSP seen from the other side

In this paper we study the complexity of counting Constraint Satisfactio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.