{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T06:32:12Z","timestamp":1716877932468},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,6]],"date-time":"2008-07-06T00:00:00Z","timestamp":1215302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10601-008-9054-z","type":"journal-article","created":{"date-parts":[[2008,7,5]],"date-time":"2008-07-05T04:05:43Z","timestamp":1215230743000},"page":"3-15","source":"Crossref","is-referenced-by-count":8,"title":["Relatively quantified constraint satisfaction"],"prefix":"10.1007","volume":"14","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,6]]},"reference":[{"issue":"1","key":"9054_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/970831.970840","volume":"35","author":"E. B\u00f6hler","year":"2004","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., & Vollmer, H. (2004). Playing with boolean blocks, part II: Constraint satisfaction problems. ACM SIGACT-Newsletter, 35(1), 22\u201335.","journal-title":"ACM SIGACT-Newsletter"},{"key":"9054_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6rner, F., Bulatov, A., Krokhin, A., & Jeavons, P. (2003). Quantified constraints: Algorithms and complexity. In Computer Science Logic 2003.","DOI":"10.1007\/978-3-540-45220-1_6"},{"key":"9054_CR3","doi-asserted-by":"crossref","unstructured":"Bulatov, A. (2003). Tractable conservative constraint satisfaction problems. In Proceedings of 18th IEEE symposium on logic in computer science (LICS \u201903) pp. 321\u2013330. Extended version appears as Oxford University technical report PRG-RR\u201303-01.","DOI":"10.1109\/LICS.2003.1210072"},{"key":"9054_CR4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"A. A. Bulatov","year":"2006","unstructured":"Bulatov, A. A. (2006). A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM (JACM), 53, 66\u2013120.","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"9054_CR5","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1137\/050628957","volume":"36","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A., & Dalmau, V. (2006). A simple algorithm for mal\u2019tsev constraints. SIAM Journal of Computing, 36(1), 16\u201327.","journal-title":"SIAM Journal of Computing"},{"key":"9054_CR6","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Chen, H., & Dalmau, V. (2004). Learnability of relatively quantified generalized formulas. In Proceedings of the 15th international conference on algorithmic learning theory (ALT).","DOI":"10.1007\/978-3-540-30215-5_28"},{"key":"9054_CR7","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Krokhin, A., & Jeavons, P. (2000). Constraint satisfaction problems and finite algebras. In Proceedings 27th international colloquium on automata, languages, and programming \u2013 ICALP\u201900, Lecture Notes In Computer Science (Vol. 1853, pp. 272\u2013282)","DOI":"10.1007\/3-540-45022-X_24"},{"key":"9054_CR8","unstructured":"Chen, H. (2004). The computational complexity of quantified constraint satisfaction. Technical Report Ph.D. thesis, Cornell University. http:\/\/www.tecn.upf.es\/~hchen ."},{"key":"9054_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H. (2005). Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms. In STACS.","DOI":"10.1007\/978-3-540-31856-9_26"},{"key":"9054_CR10","unstructured":"Chen, H. (2006). The complexity of quantified constraint satisfaction: Collapsibility, sink algebras, and the three-element case. arxiv cs.LO\/0607106."},{"key":"9054_CR11","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718546","volume-title":"Complexity classification of boolean constraint satisfaction problems","author":"N. Creignou","year":"2001","unstructured":"Creignou, N., Khanna, S., & Sudan, M. (2001). Complexity classification of boolean constraint satisfaction problems. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics."},{"key":"9054_CR12","unstructured":"Dalmau, V. (1997). Some dichotomy theorems on constant-free quantified boolean formulas. Technical Report LSI-97-43-R, Llenguatges i Sistemes Inform\u00e0tics - Universitat Polit\u00e8cnica de Catalunya."},{"key":"9054_CR13","doi-asserted-by":"crossref","unstructured":"Dalmau, V., & Pearson, J. (1999). Closure functions and width 1 problems. In CP 1999, pp. 159\u2013173.","DOI":"10.1007\/978-3-540-48085-3_12"},{"key":"9054_CR14","unstructured":"Feder, T., & Kolaitis, P. (2006). Closures and dichotomies for quantified constraints. Electronic Colloquium on Computational Complexity, Report TR06-160."},{"issue":"1","key":"9054_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., & Vardi, M.\u00a0Y. (1998). The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM Journal of Computation, 28(1), 57\u2013104.","journal-title":"SIAM Journal of Computation"},{"key":"9054_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"P. Jeavons","year":"1998","unstructured":"Jeavons, P. (1998). On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200, 185\u2013204.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"9054_CR17","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0004-3702(98)00022-8","volume":"101","author":"P. Jeavons","year":"1998","unstructured":"Jeavons, P., Cohen, D., & Cooper, M. (1998). Constraints, consistency, and closure. Artificial Intelligence, 101(1\u20132), 251\u2013265.","journal-title":"Artificial Intelligence"},{"key":"9054_CR18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. G. Jeavons","year":"1997","unstructured":"Jeavons, P. G., Cohen, D. A., & Gyssens, M. (1997). Closure properties of constraints. Journal of the ACM, 44, 527\u2013548.","journal-title":"Journal of the ACM"},{"key":"9054_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/1-4020-3817-8_8","volume-title":"The complexity of constraint satisfaction: An algebraic approach","author":"A. Krokhin","year":"2005","unstructured":"Krokhin, A., Bulatov, A., & Jeavons, P. (2005). The complexity of constraint satisfaction: An algebraic approach. Heidelberg: Springer."},{"key":"9054_CR20","doi-asserted-by":"crossref","unstructured":"Martin, B., & Madelaine, F. (2006). Towards a trichotomy for quantified H-coloring. In Logical approaches to computational barriers, second conference on computability in Europe, lecture notes in computer science. Springer.","DOI":"10.1007\/11780342_36"},{"key":"9054_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-5547-1","volume-title":"Funktionen- und Relationenalgebren","author":"R. P\u00f6schel","year":"1979","unstructured":"P\u00f6schel, R., & Kaluz\u0306nin, L. A. (1979). Funktionen- und Relationenalgebren. Boston: Birkh\u00e4user."},{"key":"9054_CR22","doi-asserted-by":"crossref","unstructured":"Schaefer, T. J. (1978). The complexity of satisfiability problems. In Proceedings of the ACM symposium on theory of computing (STOC), pp. 216\u2013226.","DOI":"10.1145\/800133.804350"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9054-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-008-9054-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9054-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:14Z","timestamp":1559243654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-008-9054-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,6]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9054"],"URL":"https:\/\/doi.org\/10.1007\/s10601-008-9054-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,6]]}}}