{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:18:43Z","timestamp":1782400723260,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642390708","type":"print"},{"value":"9783642390715","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39071-5_25","type":"book-chapter","created":{"date-parts":[[2013,6,23]],"date-time":"2013-06-23T21:23:17Z","timestamp":1372022597000},"page":"335-350","source":"Crossref","is-referenced-by-count":3,"title":["Cliquewidth and Knowledge Compilation"],"prefix":"10.1007","author":[{"given":"Igor","family":"Razgon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justyna","family":"Petke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput.\u00a034(4), 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1145\/502090.502091","volume":"48","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: Decomposable negation normal form. J. ACM\u00a048(4), 608\u2013647 (2001)","journal-title":"J. ACM"},{"issue":"1-2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. Journal of Applied Non-Classical Logics\u00a011(1-2), 11\u201334 (2001)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"25_CR5","unstructured":"Darwiche, A.: Sdd: A new canonical representation of propositional knowledge bases. In: IJCAI, pp. 819\u2013826 (2011)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. (JAIR)\u00a017, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"25_CR7","unstructured":"Dvor\u00e1k, W., Szeider, S., Woltran, S.: Reasoning in argumentation frameworks of bounded clique-width. In: COMMA, pp. 219\u2013230 (2010)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1137\/070687256","volume":"23","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width is NP-complete. SIAM J. Discrete Math.\u00a023(2), 909\u2013939 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11591191_34","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Ferrara","year":"2005","unstructured":"Ferrara, A., Pan, G., Vardi, M.Y.: Treewidth in verification: Local vs. Global. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-40064-8_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Gurski","year":"2000","unstructured":"Gurski, F., Wanke, E.: The tree-width of clique-width bounded graphs without Kn,n. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol.\u00a01928, pp. 196\u2013205. Springer, Heidelberg (2000)"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.I.: Finding branch-decompositions and rank-decompositions. SIAM J. Comput.\u00a038(3), 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.20280","volume":"57","author":"S.I. Oum","year":"2008","unstructured":"Oum, S.I.: Rank-width is less than or equal to branch-width. Journal of Graph Theory\u00a057(3), 239\u2013244 (2008)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"25_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S.I. Oum","year":"2006","unstructured":"Oum, S.I., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory, Ser. B\u00a096(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Jha, A.K., Suciu, D.: On the tractability of query compilation and bounded treewidth. In: ICDT, pp. 249\u2013261 (2012)","DOI":"10.1145\/2274576.2274603"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-21493-6_10","volume-title":"Algebraic Informatics","author":"M.M. Kant\u00e9","year":"2011","unstructured":"Kant\u00e9, M.M., Rao, M.: $\\mathbb F$-rank-width of (edge-colored) graphs. In: Winkler, F. (ed.) CAI 2011. LNCS, vol.\u00a06742, pp. 158\u2013173. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39071-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T04:52:17Z","timestamp":1780980737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39071-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390708","9783642390715"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39071-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}