论文信息 - Tractability of quantified temporal constraints to the max

Tractability of quantified temporal constraints to the max

A temporal constraint language is a set of relations that are first-order definable over (ℚ;<). We show that several temporal constraint languages whose constraint satisfaction problem is maximally tractable are also maximally tractable for the more expressive quantified constraint satisfaction problem. These constraint languages are defined in terms of preservation under certain binary polymorphisms. We also present syntactic characterizations of the relations in these languages.

[1] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[2] Manuel Bodirsky,et al. A fast algorithm and datalog inexpressibility for temporal reasoning , 2010, TOCL.

[3] Manuel Bodirsky,et al. Quantified Equality Constraints , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[4] Peter Jeavons,et al. The complexity of constraint satisfaction games and QCSP , 2009, Inf. Comput..

[5] Libor Barto,et al. Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

[6] Dugald Macpherson,et al. A survey of homogeneous structures , 2011, Discret. Math..

[7] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2010, JACM.

[8] Witold Charatonik,et al. Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates , 2008, LPAR.

[9] Manuel Bodirsky,et al. Relatively quantified constraint satisfaction , 2009, Constraints.

[10] Martin C. Cooper,et al. Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[11] Hubie Chen. Meditations on Quantified Constraint Satisfaction , 2012, Logic and Program Semantics.

[12] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..