{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:03:28Z","timestamp":1777125808972,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642215803","type":"print"},{"value":"9783642215810","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21581-0_5","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T13:30:19Z","timestamp":1307712619000},"page":"33-46","source":"Crossref","is-referenced-by-count":4,"title":["On Variables with Few Occurrences in Conjunctive Normal Forms"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Kullmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xishun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0097-3165(86)90060-9","volume":"43","author":"R. Aharoni","year":"1986","unstructured":"Aharoni, R., Linial, N.: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. Journal of Combinatorial Theory, A\u00a043, 196\u2013204 (1986)","journal-title":"Journal of Combinatorial Theory, A"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1018924526592","volume":"23","author":"G. Davydov","year":"1998","unstructured":"Davydov, G., Davydova, I., B\u00fcning, H.K.: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence\u00a023, 229\u2013245 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Gebauer, H., Szabo, T., Tardos, G.: The local lemma is tight for SAT. Technical Report arXiv:1006.0744v1 [math.CO], arXiv.org (June 2010)","DOI":"10.1137\/1.9781611973082.52"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(00)00245-6","volume":"107","author":"H.K. B\u00fcning","year":"2000","unstructured":"B\u00fcning, H.K.: On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics\u00a0107, 83\u201398 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR5","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"339","volume-title":"Handbook of Satisfiability","author":"H.K. B\u00fcning","year":"2009","unstructured":"B\u00fcning, H.K., Kullmann, O.: Minimal unsatisfiability and autarkies. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, ch.11, pp. 339\u2013401. IOS Press, Amsterdam (2009)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/CCC.2000.856741","volume-title":"Fifteenth Annual IEEE Conference on Computational Complexity (2000)","author":"O. Kullmann","year":"2000","unstructured":"Kullmann, O.: An application of matroid theory to the SAT problem. In: Fifteenth Annual IEEE Conference on Computational Complexity (2000), pp. 116\u2013124. IEEE Computer Society, Los Alamitos (July 2000)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(02)00406-7","volume":"130","author":"O. Kullmann","year":"2003","unstructured":"Kullmann, O.: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets. Discrete Applied Mathematics\u00a0130, 209\u2013249 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR8","unstructured":"Kullmann, O.: On some connections between linear algebra and the combinatorics of clause-sets. In: Franco, J., Giunchiglia, E., Kautz, H., B\u00fcning, H.K., van Maaren, H., Selman, B., Speckenmeyer, E. (eds.) Sixth International Conference on Theory and Applications of Satisfiability Testing, Santa Margherita Ligure \u2013 Portofino, Italy, May 5-8, pp. 45\u201359 (2003)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-14186-7_32","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"O. Kullmann","year":"2010","unstructured":"Kullmann, O.: Green-tao numbers and SAT. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 352\u2013362. Springer, Heidelberg (2010)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kullmann, O.: Constraint satisfaction problems in clausal form. Technical Report arXiv:1103.3693v1 [cs.DM], arXiv (March 2011)","DOI":"10.3233\/FI-2011-428"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Kullmann, O.: Constraint satisfaction problems in clausal form I: Autarkies and deficiency. Fundamenta Informaticae 109 (to appear, 2011)","DOI":"10.3233\/FI-2011-428"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kullmann, O.: Constraint satisfaction problems in clausal form II: Minimal unsatisfiability and conflict structure. Fundamenta Informaticae 109 (to appear, 2011)","DOI":"10.3233\/FI-2011-429"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kullmann, O., Zhao, X.: Bounds for variables with few occurrences in conjunctive normal forms (in preparation, 2011)","DOI":"10.1007\/978-3-642-21581-0_5"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Applied Mathematics\u00a08, 85\u201389 (1984)","journal-title":"Discrete Applied Mathematics"},{"issue":"7","key":"5_CR15","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/BF02878991","volume":"42","author":"X. Zhao","year":"1999","unstructured":"Zhao, X., Decheng, D.: Two tractable subclasses of minimal unsatisfiable formulas. Science in China (Series A)\u00a042(7), 720\u2013731 (1999)","journal-title":"Science in China (Series A)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21581-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T01:16:20Z","timestamp":1592615780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}