{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:17Z","timestamp":1725895337607},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_36","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"480-495","source":"Crossref","is-referenced-by-count":3,"title":["Containment, Equivalence and Coreness from CSP to QCSP and Beyond"],"prefix":"10.1007","author":[{"given":"Florent","family":"Madelaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1137\/070708093","volume":"38","author":"L. Barto","year":"2009","unstructured":"Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing\u00a038(5), 1782\u20131802 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"36_CR2","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/j.ic.2009.05.003","volume":"207","author":"F. B\u00f6rner","year":"2009","unstructured":"B\u00f6rner, F., Bulatov, A.A., Chen, H., Jeavons, P., Krokhin, A.A.: The complexity of constraint satisfaction games and QCSP. Inf. Comput.\u00a0207(9), 923\u2013944 (2009)","journal-title":"Inf. Comput."},{"issue":"1","key":"36_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"J. ACM"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing\u00a034, 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceddings of STOC 1977, pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H.: Meditations on quantified constraint satisfaction. CoRR abs\/1201.6306 (2012)","DOI":"10.1007\/978-3-642-29485-3_4"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Madelaine, F., Martin, B.: Quantified constraints and containment problems. In: 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 317\u2013328 (2008)","DOI":"10.1109\/LICS.2008.15"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, D., Jeavons, P.: The complexity of constraint languages. Appears in: Handbook of Constraint Programming (2006)","DOI":"10.1016\/S1574-6526(06)80012-X"},{"issue":"1","key":"36_CR9","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1145\/1061318.1061323","volume":"30","author":"R. Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst.\u00a030(1), 174\u2013210 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1999","unstructured":"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\u00a028, 57\u2013104 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0012-365X(92)90282-K","volume":"109","author":"P. Hell","year":"1992","unstructured":"Hell, P., Nesetril, J.: The core of a graph. Discrete Math.\u00a0109, 117\u2013126 (1992)","journal-title":"Discrete Math."},{"key":"36_CR12","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\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Madelaine, F., Martin, B.: Containment, equivalence and coreness from CSP to QCSP and beyond. CoRR abs\/1204.5981 (2012)","DOI":"10.1007\/978-3-642-33558-7_36"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Madelaine, F.R., Martin, B.: A tetrachotomy for positive first-order logic without equality. In: LICS, pp. 311\u2013320 (2011)","DOI":"10.1109\/LICS.2011.27"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-642-23786-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"B. Martin","year":"2011","unstructured":"Martin, B.: QCSP on Partially Reflexive Forests. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 546\u2013560. Springer, Heidelberg (2011)"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/11780342_36","volume-title":"Logical Approaches to Computational Barriers","author":"B. Martin","year":"2006","unstructured":"Martin, B., Madelaine, F.: Towards a Trichotomy for Quantified H-Coloring. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 342\u2013352. Springer, Heidelberg (2006)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T03:16:25Z","timestamp":1557285385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}