{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:34:08Z","timestamp":1725514448589},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_56","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"616-623","source":"Crossref","is-referenced-by-count":1,"title":["The Existence of Unsatisfiable Formulas in k-LCNF for k\u2009\u2265\u20093"],"prefix":"10.1007","author":[{"given":"Qingshun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoyun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1018924526592","volume":"23","author":"G. Davydov","year":"1998","unstructured":"Davydov, G., Davydova, I., Kleine B\u00fcning, H.: 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"},{"issue":"1","key":"56_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/S0304-3975(01)00337-1","volume":"289","author":"H. Fleischner","year":"2002","unstructured":"Fleischner, H., Kullmann, O., Szeider, S.: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science\u00a0289(1), 503\u2013516 (2002)","journal-title":"Theoretical Computer Science"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Porschen, S., Speckenmeyer, E.: Linear CNF formulas and satisfiability. Tech. Report zaik2006-520, University K\u00f6ln (2006)","DOI":"10.1007\/11814948_22"},{"key":"56_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11814948_22","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S. Porschen","year":"2006","unstructured":"Porschen, S., Speckenmeyer, E., Randerath, B.: On linear CNF formulas. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 212\u2013225. Springer, Heidelberg (2006)"},{"key":"56_CR5","unstructured":"Porschen, S., Speckenmeyer, E.: NP-completeness of SAT for restricted linear formulas classes. In: Proceedings of Guangzhou Symposium on Satisfiability in Logic-Based Modeling, pp. 111\u2013123."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:27Z","timestamp":1619516307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_56","relation":{},"subject":[]}}