{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:54:57Z","timestamp":1760079297911},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_59","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"694-705","source":"Crossref","is-referenced-by-count":8,"title":["Enumerating All Solutions for Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Henning","family":"Schnoor","sequence":"first","affiliation":[]},{"given":"Ilka","family":"Schnoor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Allender, E., et al.: The complexity of satisfiability problems: Refining Schaefer\u2019s Theorem. In: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, pp. 71\u201382 (2005)","DOI":"10.1007\/11549345_8"},{"key":"59_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-45793-3_28","volume-title":"Computer Science Logic","author":"E. B\u00f6hler","year":"2002","unstructured":"B\u00f6hler, E., et al.: Equivalence and isomorphism for Boolean constraint satisfaction. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 412\u2013426. Springer, Heidelberg (2002)"},{"issue":"3","key":"59_CR3","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput.\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"59_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45022-X_24","volume-title":"Automata, Languages and Programming","author":"A. Bulatov","year":"2000","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: Constraint satisfaction problems and finite algebras. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 272\u2013282. Springer, Heidelberg (2000)"},{"issue":"1","key":"59_CR5","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. Journal of the ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"Journal of the ACM"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0016","volume":"125","author":"N. Creignou","year":"1996","unstructured":"Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation\u00a0125, 1\u201312 (1996)","journal-title":"Information and Computation"},{"issue":"6","key":"59_CR7","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1051\/ita\/1997310604991","volume":"31","author":"N. Creignou","year":"1997","unstructured":"Creignou, N., H\u00e9brard, J.-J.: On generating all solutions of generalized satisfiability problems. Theoretical Informatics and Applications\u00a031(6), 499\u2013511 (1997)","journal-title":"Theoretical Informatics and Applications"},{"key":"59_CR8","series-title":"Monographs on Discrete Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718546","volume-title":"Complexity Classifications of Boolean Constraint Satisfaction Problems","author":"N. Creignou","year":"2001","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics. SIAM, Philadelphia (2001)"},{"issue":"3","key":"59_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/B:CONS.0000036045.82829.94","volume":"9","author":"D. Cohen","year":"2004","unstructured":"Cohen, D.: Tractable decision for a constraint language implies tractable search. Constraints\u00a09(3), 219\u2013229 (2004)","journal-title":"Constraints"},{"key":"59_CR10","first-page":"438","volume-title":"Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005","author":"V. Dalmau","year":"2005","unstructured":"Dalmau, V.: Generalized majority-minority operations are tractable. In: Panangaden, P. (ed.) Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005, June 2005, pp. 438\u2013447. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"59_CR11","unstructured":"Dalmau, V., Krokhin, A.: Majority constraints have bounded pathwidth duality. Technical Report NI06017-LAA, Isaac Newton Institute for Mathematical Sciences (2006)"},{"issue":"1","key":"59_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadis SNP and constraint satisfaction: a study through Datalog and group theory. SIAM Journal on Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"59_CR13","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\u00a044(4), 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"issue":"3","key":"59_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D. Johnson","year":"1988","unstructured":"Johnson, D., Papadimitriou, C., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett.\u00a027(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"59_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/3-540-44612-5_59","volume-title":"Mathematical Foundations of Computer Science 2000","author":"S. Reith","year":"2000","unstructured":"Reith, S., Vollmer, H.: Optimal satisfiability for propositional calculi and constraint satisfaction problems. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 640\u2013649. Springer, Heidelberg (2000)"},{"key":"59_CR16","first-page":"216","volume-title":"Proceedings 10th Symposium on Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York (1978)"},{"key":"59_CR17","unstructured":"Schnoor, H., Schnoor, I.: Enumerating all solutions for constraint satisfaction problems. In: Complexity of Constraints. Dagstuhl Seminar Proceedings, vol.\u00a006401 (2006), \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/804"},{"key":"59_CR18","unstructured":"Schnoor, H., Schnoor, I.: New algebraic tools for constraint satisfaction. In: Complexity of Constraints. Dagstuhl Seminar Proceedings, vol.\u00a006401 (2006), \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/805"},{"issue":"3","key":"59_CR19","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal of Computing\u00a08(3), 411\u2013421 (1979)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:02Z","timestamp":1605762722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_59","relation":{},"subject":[]}}