{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:06:09Z","timestamp":1743012369068,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_15","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"208-219","source":"Crossref","is-referenced-by-count":0,"title":["The Weight in Enumeration"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"issue":"18","key":"15_CR1","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.ipl.2009.06.015","volume":"109","author":"O Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. Inf. Process. Lett. 109(18), 1071\u20131077 (2009)","journal-title":"Inf. Process. Lett."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6hler, E., Creignou, N., Galota, M., Reith, S., Schnoor, H., Vollmer, H.: Complexity classifications for different equivalence and audit problems for Boolean circuits. Logical Methods Comput. Sci. 8(3) (2012). https:\/\/lmcs.episciences.org\/1172","DOI":"10.2168\/LMCS-8(3:31)2012"},{"issue":"2","key":"15_CR3","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.jcss.2011.12.002","volume":"78","author":"AA Bulatov","year":"2012","unstructured":"Bulatov, A.A., Dyer, M.E., Goldberg, L.A., Jalsenius, M., Jerrum, M., Richerby, D.: The complexity of weighted and unweighted #csp. J. Comput. Syst. Sci. 78(2), 681\u2013688 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"15_CR4","first-page":"499","volume":"31","author":"N Creignou","year":"1997","unstructured":"Creignou, N., H\u00e9brard, J.-J.: On generating all solutions of generalized satisfiability problems. ITA 31(6), 499\u2013511 (1997)","journal-title":"ITA"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-21581-0_11","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"N Creignou","year":"2011","unstructured":"Creignou, N., Olive, F., Schmidt, J.: Enumerating all solutions of a Boolean CSP by non-decreasing weight. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 120\u2013133. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21581-0_11"},{"issue":"5","key":"15_CR6","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1093\/logcom\/exr012","volume":"22","author":"N Creignou","year":"2012","unstructured":"Creignou, N., Schmidt, J., Thomas, M.: Complexity classifications for propositional abduction in post\u2019s framework. J. Log. Comput. 22(5), 1145\u20131170 (2012)","journal-title":"J. Log. Comput."},{"issue":"3","key":"15_CR7","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.tcs.2005.03.012","volume":"340","author":"A Durand","year":"2005","unstructured":"Durand, A., Hermann, M., Kolaitis, P.G.: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3), 496\u2013513 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Ko, C., Rado, R.: Intersection theorem for system of finite sets. Quart. J. Math. Oxford Ser. 12, 313\u2013318 (1961)","journal-title":"Quart. J. Math. Oxford Ser."},{"issue":"3","key":"15_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Khanna, S., Sudan, M., Williamson, D.P.: A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction. In: STOC, pp. 11\u201320 (1997)","DOI":"10.1145\/258533.258538"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11780991_13","volume-title":"Next Generation Information Technologies and Systems","author":"B Kimelfeld","year":"2006","unstructured":"Kimelfeld, B., Sagiv, Y.: Incrementally computing ordered answers of acyclic conjunctive queries. In: Etzion, O., Kuflik, T., Motro, A. (eds.) NGITS 2006. LNCS, vol. 4032, pp. 141\u2013152. Springer, Heidelberg (2006). doi: 10.1007\/11780991_13"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01744287","volume":"13","author":"H Lewis","year":"1979","unstructured":"Lewis, H.: Satisfiability problems for propositional calculi. Math. Syst. Theory 13, 45\u201353 (1979)","journal-title":"Math. Syst. Theory"},{"key":"15_CR13","first-page":"1","volume":"5","author":"E Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Ann. Math. Stud. 5, 1\u2013122 (1941)","journal-title":"Ann. Math. Stud."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-540-45138-9_57","volume-title":"Mathematical Foundations of Computer Science 2003","author":"S Reith","year":"2003","unstructured":"Reith, S.: On the complexity of some equivalence problems for propositional calculi. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 632\u2013641. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45138-9_57"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing, pp. 216\u2013226. ACM Press (1978)","DOI":"10.1145\/800133.804350"},{"key":"15_CR16","unstructured":"Schmidt, J.: Enumeration: Algorithms and complexity. Preprint (2009). http:\/\/www.thi.uni-hannover.de\/fileadmin\/forschung\/arbeiten\/schmidt-da.pdf"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-70918-3_59","volume-title":"STACS 2007","author":"H Schnoor","year":"2007","unstructured":"Schnoor, H., Schnoor, I.: Enumerating all solutions for constraint satisfaction problems. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 694\u2013705. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-70918-3_59"},{"key":"15_CR18","unstructured":"Schnorr, C.: Optimal algorithms for self-reducible problems. In: ICALP, pp. 322\u2013337 (1976)"},{"key":"15_CR19","unstructured":"Strozecki, Y.: Enumeration complexity and matroid decomposition. Ph.D. thesis (2010)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-04238-6_25","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Thomas","year":"2009","unstructured":"Thomas, M.: The complexity of circumscriptive inference in post\u2019s lattice. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 290\u2013302. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04238-6_25"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:35:54Z","timestamp":1498372554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}