Manuel Bodirsky
Skip Abstract Section
Abstract
A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) over the set of integers whose constraint language consists of relations that are first-order definable over the order of the integers. We prove that every discrete temporal CSP is in P or NP-complete, unless it can be formulated as a finite domain CSP, in which case the computational complexity is not known in general.
- Marc Bezem, Robert Nieuwenhuis, and Enric Rodríguez-Carbonell. 2008. The max-atom problem and its relevance. In Proceedings of the International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR’08). 47--61. Google Scholar
Digital Library
- Manuel Bodirsky. 2012. Complexity Classification in Infinite-Domain Constraint Satisfaction. (2012). Mémoire d’habilitation à diriger des recherches, Université Diderot, Paris 7. arXiv:1201.0856.Google Scholar
- Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, and Michael Pinsker. 2016. Distance constraint satisfaction problems. Inf. Comput. 247 (Apr. 2016), 87--105. Google ScholarDigital Library
- Manuel Bodirsky, Martin Hils, and Barnaby Martin. 2012. On the scope of the universal-algebraic approach to constraint satisfaction. Logic. Methods Comput. Sci. 8, 3:13 (2012).Google Scholar
- Manuel Bodirsky and Jan Kára. 2009. The complexity of temporal constraint satisfaction problems. J. ACM 57, 2 (2009), 1--41. Google ScholarDigital Library
- Manuel Bodirsky and Antoine Mottet. 2016. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. In Proceedings of the 31th Annual IEEE Symposium on Logic in Computer Science (LICS’16). 623--632. Google ScholarDigital Library
- Manuel Bodirsky and Jaroslav Nešetřil. 2006. Constraint satisfaction with countable homogeneous templates. J. Logic Comput. 16, 3 (2006), 359--373. Google ScholarDigital Library
- Manuel Bodirsky and Michael Pinsker. 2015. Schaefer’s theorem for graphs. J. ACM 62, 3 (2015), 52 pages (article number 19). Google ScholarDigital Library
- V. G. Bodnarčuk, L. A. Kalužnin, V. N. Kotov, and B. A. Romov. 1969. Galois theory for post algebras, part I and II. Cybernetics 5, 3 (1969), 243--539.Google ScholarCross Ref
- Andrei A. Bulatov. 2017. A dichotomy theorem for nonuniform CSPs. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS’17). arXiv:1703.03021.Google ScholarCross Ref
- T.-W. J. Chou and G. E. Collins. 1982. Algorithms for the solution of systems of linear Diophantine equations. SIAM J. Comput. 11 (1982), 687--708.Google ScholarDigital Library
- Andrzej Ehrenfeucht and Jan Mycielski. 1979. Positional strategies for mean payoff games. Int. J. Game Theor. 8, 2 (1979), 109--113.Google ScholarCross Ref
- Tomás Feder and Moshe Y. Vardi. 1998. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28, 1 (1998), 57--104. Google ScholarDigital Library
- David Geiger. 1968. Closed systems of functions and predicates. Pac. J. Math. 27, 1 (1968), 95--100.Google ScholarCross Ref
- Pavol Hell and Jaroslav Nešetřil. 1990. On the complexity of H-coloring. J. Combin. Theor. Ser. B 48 (1990), 92--110. Google ScholarDigital Library
- Wilfrid Hodges. 1997. A Shorter Model Theory. Cambridge University Press, Cambridge. Google ScholarDigital Library
- Peter Jeavons, David Cohen, and Marc Gyssens. 1997. Closure properties of constraints. J. ACM 44, 4 (1997), 527--548. Google ScholarDigital Library
- Peter Jonsson and Tomas Lööw. 2013. Computation complexity of linear constraints over the integers. Artif. Intell. 195 (2013), 44--62. Google ScholarDigital Library
- Dexter Kozen. 1983. Results on the propositional μ-calculus. Theoret. Comput. Sci. 27, 3 (1983), 333--354.Google ScholarCross Ref
- A. K. Mackworth. 1977. Consistency in networks of relations. Artif. Intell. 8, 1 (1977), 99--118. Google ScholarDigital Library
- Rolf H. Möhring, Martin Skutella, and Frederik Stork. 2004. Scheduling with AND/OR precedence constraints. SIAM J. Comput. 33, 2 (2004), 393--415. Google ScholarDigital Library
- Arash Rafiey, Jeff Kinne, and Tomás Feder. 2017. Dichotomy for Digraph Homomorphism Problems. (2017). arXiv:1701.02409.Google Scholar
- Dmitriy Zhuk. 2017. The proof of CSP dichotomy conjecture. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS’17). arXiv:1704.01914.Google ScholarCross Ref
Index Terms
- Discrete Temporal Constraint Satisfaction Problems
Recommendations
Binarisation for Valued Constraint Satisfaction Problems
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, ...
ICHEA for discrete constraint satisfaction problems
AI'12: Proceedings of the 25th Australasian joint conference on Advances in Artificial IntelligenceConstraint satisfaction problem (CSP) is a subset of optimization problem where at least one solution is sought that satisfies all the given constraints. Presently, evolutionary algorithms (EAs) have become standard optimization techniques for solving ...
Comments