{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:33Z","timestamp":1725470853077},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_59","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"726-730","source":"Crossref","is-referenced-by-count":3,"title":["The Effect of Constraint Representation on Structural Tractability"],"prefix":"10.1007","author":[{"given":"Chris","family":"Houghton","sequence":"first","affiliation":[]},{"given":"David","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Martin J.","family":"Green","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"issue":"2","key":"59_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artif. Intell.\u00a0124(2), 243\u2013282 (2000)","journal-title":"Artif. Intell."},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Rissanen, J.: Modeling by shortest data description. In: Automatica, vol.\u00a014 (1978)","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of sat. In: SAT, pp. 188\u2013202 (2003)","DOI":"10.1007\/978-3-540-24605-3_15"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:32Z","timestamp":1605642692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/11889205_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}