{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:32:58Z","timestamp":1742995978832,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_21","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"256-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Constraint Satisfaction Problems over the Integers with Successor"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Mottet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-15155-2_16","volume-title":"mathematical foundations of computer science 2010","author":"M Bodirsky","year":"2010","unstructured":"Bodirsky, M., Dalmau, V., Martin, B., Pinsker, M.: Distance constraint satisfaction problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 162\u2013173. Springer, Heidelberg (2010)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Hils, M., Martin, B.: On the scope of the universal-algebraic approach to constraint satisfaction. Logical Methods in Computer Science (LMCS) 8(3), 13 (2012). An extended abstract that announced some of the results appeared in the proceedings of Logic in Computer Science (LICS 2010)","DOI":"10.2168\/LMCS-8(3:13)2012"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of equality constraint languages. Theory of Computing Systems 3(2), 136\u2013158 (2008). A conference version appeared in the proceedings of Computer Science Russia (CSR 2006)","DOI":"10.1007\/s00224-007-9083-9"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems. Journal of the ACM 57(2), 1\u201341 (2009). An extended abstract appeared in the Proceedings of the Symposium on Theory of Computing (STOC 2008)","DOI":"10.1145\/1667053.1667058"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/logcom\/exi083","volume":"16","author":"M Bodirsky","year":"2006","unstructured":"Bodirsky, M., Ne\u0161et\u0159il, J.: Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation 16(3), 359\u2013373 (2006)","journal-title":"Journal of Logic and Computation"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Pinsker, M.: Schaefer\u2019s theorem for graphs. In: Proceedings of the Annual Symposium on Theory of Computing (STOC), pp. 655\u2013664 (2011). Preprint of the long version available at arxiv.org\/abs\/1011.2894","DOI":"10.1145\/1993636.1993724"},{"key":"21_CR7","unstructured":"Bulatov, A.A., Jeavons, P., and Krokhin, A.A.: The complexity of constraint satisfaction: an algebraic approach (a survey paper). In: Structural Theory of Automata, Semigroups and Universal Algebra (Montreal, 2003), NATO Science Series II: Mathematics, Physics, Chemistry 207, 181\u2013213 (2005)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T Feder","year":"1999","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM Journal on Computing 28, 57\u2013104 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198529804.001.0001","volume-title":"A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)","author":"S Hedman","year":"2004","unstructured":"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)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"21_CR11","volume-title":"A shorter model theory","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44(4), 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.artint.2012.10.001","volume":"195","author":"P Jonsson","year":"2013","unstructured":"Jonsson, P., L\u00f6\u00f6w, T.: Computation complexity of linear constraints over the integers. Artificial Intelligence 195, 44\u201362 (2013)","journal-title":"Artificial Intelligence"},{"key":"21_CR14","volume-title":"Model Theory: An Introduction","author":"D Marker","year":"2002","unstructured":"Marker, D.: Model Theory: An Introduction. Springer, New York (2002)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00012-008-2122-9","volume":"59","author":"M Mar\u00f3ti","year":"2008","unstructured":"Mar\u00f3ti, M., McKenzie, R.: Existence theorems for weakly symmetric operations. Algebra Universalis 59, 3 (2008)","journal-title":"Algebra Universalis"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:24:02Z","timestamp":1674228242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}