The Complexity of Temporal Constraint Satisfaction Problems

被引：0

作者：

Bodirsky, Manuel ^{[1
]}

Kara, Jan ^{[1
]}

机构：

[1] Ecole Polytech, Lab Informat LIX, F-91128 Palaiseau, France

来源：

STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING | 2008年

关键词：

Constraint satisfaction; Temporal reasoning; Complexity;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint languages, then the CSP can be solved in polynomial time; otherwise, the CSP is NP-complete. Our proof combines model-theoretic concepts with techniques from universal algebra, and also applies the so-called product Ramsey theorem, which we believe will be useful in similar contexts of constraint satisfaction complexity classification.

引用

页码：29 / 38

页数：10

共 50 条

[1] The Complexity of Temporal Constraint Satisfaction Problems
Bodirsky, Manuel
Kara, Jan
[J]. JOURNAL OF THE ACM, 2010, 57 (02)
[2] On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
Bodirsky, Manuel
Rydval, Jakub
[J]. JOURNAL OF THE ACM, 2023, 70 (01)
[3] The Complexity of Constraint Satisfaction Problems
Bodirsky, Manuel
[J]. 32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 2 - 9
[4] Complexity of Conservative Constraint Satisfaction Problems
Bulatov, Andrei A.
[J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (04)
[5] Constraint Satisfaction Problems: Complexity and Algorithms
Bulatov, Andrei A.
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 1 - 25
[6] Parameterized complexity of constraint satisfaction problems
Dániel Marx
[J]. computational complexity, 2005, 14 : 153 - 183
[7] Parameterized complexity of constraint satisfaction problems
Marx, D
[J]. COMPUTATIONAL COMPLEXITY, 2005, 14 (02) : 153 - 183
[8] Parameterized complexity of constraint satisfaction problems
Marx, D
[J]. 19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 139 - 149
[9] The Complexity of Phylogeny Constraint Satisfaction Problems
Bodirsky, Manuel
Jonsson, Peter
Trung Van Pham
[J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2017, 18 (03)
[10] The complexity of recursive constraint satisfaction problems
Marek, Victor W.
Remmel, Jeffrey B.
[J]. ANNALS OF PURE AND APPLIED LOGIC, 2009, 161 (03) : 447 - 457

← 1 2 3 4 5 →