{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:42:43Z","timestamp":1710326563311},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2004,12,31]],"date-time":"2004-12-31T00:00:00Z","timestamp":1104451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10472-005-0422-8","type":"journal-article","created":{"date-parts":[[2005,3,2]],"date-time":"2005-03-02T19:19:42Z","timestamp":1109791182000},"page":"113-127","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of homomorphisms and renamings for minimal unsatisfiable formulas"],"prefix":"10.1007","volume":"43","author":[{"given":"Hans Kleine","family":"B\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoyun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,12,31]]},"reference":[{"key":"422_CR1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0097-3165(86)90060-9","volume":"43","author":"R. Aharoni","year":"1996","unstructured":"R. Aharoni, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, Journal of Combinatorial Theory, Series A 43 (1996) 196\u2013204.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"422_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1018924526592","volume":"23","author":"G. Davydov","year":"1998","unstructured":"G. Davydov, I. Davydova and H. Kleine B\u00fcning, An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF, Annals of Mathematics and Artificial Intelligence 23 (1998) 229\u2013245.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"422_CR3","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0304-3975(01)00337-1","volume":"289","author":"H. Fleischner","year":"2002","unstructured":"H. Fleischner, O. Kullmann and S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference, Theoretical Computer Science 289 (2002) 503\u2013516.","journal-title":"Theoretical Computer Science"},{"key":"422_CR4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"P. Hell and J. Ne\u0161et\u0159il, On the complexity of H-coloring, Journal of Combinatorial Theory, Series B 48 (1990) 92\u2013110.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"422_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0020-0190(02)00267-3","volume":"84","author":"H. Kleine B\u00fcning","year":"2002","unstructured":"H. Kleine B\u00fcning and X. Zhao, Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency, Information Processing Letters 84 (2002) 147\u2013151.","journal-title":"Information Processing Letters"},{"key":"422_CR6","doi-asserted-by":"crossref","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning and J. Toran, The Graph Isomorphism Problem: Its Structural Complexity (Birkh\u00e4user, 1993).","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"422_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00265682","volume":"22","author":"B. Krishnamurthy","year":"1985","unstructured":"B. Krishnamurthy, Short proofs for tricky formulas, Acta Informatica 22 (1985) 253\u2013275.","journal-title":"Acta Informatica"},{"key":"422_CR8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"C.H. Papadimitriou","year":"1988","unstructured":"C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Sciences 37 (1988) 2\u201313.","journal-title":"Journal of Computer and System Sciences"},{"key":"422_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0166-218X(02)00411-0","volume":"130","author":"S. Szeider","year":"2003","unstructured":"S. Szeider, Homomorphisms of conjunctive normal forms, Discrete Applied Mathematics 130 (2003) 351\u2013365.","journal-title":"Discrete Applied Mathematics"},{"key":"422_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-218X(99)00039-6","volume":"96\u201397","author":"A. Urquhart","year":"1999","unstructured":"A. Urquhart, The symmetry rule in propositional logic, Discrete Applied Mathematics 96\u201397 (1999) 177\u2013193.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-005-0422-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-005-0422-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-005-0422-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:51:48Z","timestamp":1559152308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-005-0422-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12,31]]},"references-count":10,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["422"],"URL":"https:\/\/doi.org\/10.1007\/s10472-005-0422-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12,31]]}}}