Abstract
We study the complexity of constraint satisfaction problems for templates \(\it\Gamma\) that are first-order definable in \(({\mathbb Z}; {\it suc})\), the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of transitive finite templates), we provide a full classification for the case that \(\it\Gamma\) is locally finite (i.e., the Gaifman graph of \(\it\Gamma\) has finite degree). We show that one of the following is true: The structure \(\it\Gamma\) is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and CSP\((\it\Gamma)\) can be solved in polynomial time, or \(\it\Gamma\) is homomorphically equivalent to a finite transitive structure, or CSP\((\it\Gamma)\) is NP-complete.
Keywords
- Automorphism Group
- Binary Relation
- Constraint Satisfaction
- Constraint Satisfaction Problem
- Relation Symbol
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bodirsky, M.: Cores of countably categorical structures. Logical Methods in Computer Science (LMCS) 3(1), 1–16 (2007), doi:10.2168/LMCS-3(1:2)
Bodirsky, M., Chen, H., Pinsker, M.: The reducts of equality up to primitive positive interdefinability. To appear in the Journal of Symbolic Logic (2010)
Bodirsky, M., Dalmau, V., Martin, B., Pinsker, M.: Distance constraint satisfaction problems. CoRR, abs/1004.3842 (2010)
Bodirsky, M., Grohe, M.: Non-dichotomies in constraint satisfaction complexity. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 184–196. Springer, Heidelberg (2008)
Bodirsky, M., Hils, M., Martin, B.: On the scope of the universal-algebraic approach to constraint satisfaction. In: Proceedings of LICS 2010 (2010)
Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems complexity of temporal constraint satisfaction problems. Journal of the ACM 57(2) (2009); An extended abstract appeared in the proceedings of STOC 2008
Bodirsky, M., Nešetřil, J.: Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation 16(3), 359–373 (2006)
Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Cameron, P.J.: Oligomorphic Permutation Groups. Cambridge Univ. Press, Cambridge (1990)
Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.): Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. LNCS, vol. 5250. Springer, Heidelberg (2008)
Diestel, R.: Graph Theory, 3rd edn. Springer, New York (2005)
Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57–104 (1999)
Hedman, S.: A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic). Oxford University Press, Inc., New York (2004)
Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48, 92–110 (1990)
Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)
Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)
Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. AI 101(1-2), 251–265 (1998)
Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. JACM 44(4), 527–548 (1997)
Marker, D.: Model Theory: An Introduction. Springer, New York (2002)
Reingold, O.: Undirected st-connectivity in log-space. In: STOC, pp. 376–385 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodirsky, M., Dalmau, V., Martin, B., Pinsker, M. (2010). Distance Constraint Satisfaction Problems. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-15155-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15154-5
Online ISBN: 978-3-642-15155-2
eBook Packages: Computer ScienceComputer Science (R0)