{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:49:31Z","timestamp":1742982571100,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_41","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T06:19:21Z","timestamp":1232605161000},"page":"449-460","source":"Crossref","is-referenced-by-count":3,"title":["On Some SAT-Variants over Linear Formulas"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Porschen","sequence":"first","affiliation":[]},{"given":"Tatjana","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.tcs.2004.12.023","volume":"332","author":"J.M. Byskov","year":"2005","unstructured":"Byskov, J.M., Ammitzboll Madsen, B., Skjernaa, B.: New Algorithms for Exact Satisfiability. Theoretical Comp. Sci.\u00a0332, 515\u2013541 (2005)","journal-title":"Theoretical Comp. Sci."},{"key":"41_CR3","unstructured":"Eiter, T.: Open Problems in Satisfiability, http:\/\/www.ece.uc.edu\/~franco\/Sat-workshop\/sat-workshop-open-problems.html"},{"key":"41_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55611-7","volume-title":"Axioms and Hulls","author":"D.E. Knuth","year":"1992","unstructured":"Knuth, D.E.: Axioms and Hulls. LNCS, vol.\u00a0606. Springer, Heidelberg (1992)"},{"key":"41_CR6","unstructured":"Lam, C.W.H., Thiel, L., Swiercz, S.: The Non-existence of Finite Projective Planes of Order 10, article dedicated to the memory of H. J. Ryser (1989), http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary\/doi=10.1.1.39.8684"},{"key":"41_CR7","first-page":"419","volume":"43","author":"B. Monien","year":"1981","unstructured":"Monien, B., Speckenmeyer, E., Vornberger, O.: Upper Bounds for Covering Problems. Methods of Operations Research\u00a043, 419\u2013431 (1981)","journal-title":"Methods of Operations Research"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/0012-365X(93)90179-W","volume":"111","author":"R. Palisse","year":"1993","unstructured":"Palisse, R.: A short proof of Fisher\u2019s inequality. Discrete Math.\u00a0111, 421\u2013422 (1993)","journal-title":"Discrete Math."},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-79719-7_22","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"S. Porschen","year":"2008","unstructured":"Porschen, S., Speckenmeyer, E.: A CNF class generalizing Exact Linear Formulas. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 231\u2013245. Springer, Heidelberg (2008)"},{"key":"41_CR10","unstructured":"Porschen, S., Speckenmeyer, E., Zhao, X.: Linear CNF formulas and satisfiability. Discrete Appl. Math. (2008) doi:10.1016\/j.dam, 03.031"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Ryser, H.J.: Combinatorial Mathematics, Carus Mathematical Monographs 14, Mathematical Association of America (1963)","DOI":"10.5948\/UPO9781614440147"},{"key":"41_CR12","first-page":"216","volume-title":"Proc. STOC","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. STOC, pp. 216\u2013226. ACM, New York (1978)"},{"key":"41_CR13","unstructured":"Scheder, D.: Unsatisfiable Linear k-CNFs Exist, for every k (preprint, 2007) arXiv:math cs.DM\/0708.2336 v1"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T09:12:18Z","timestamp":1632993138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}