{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:59:35Z","timestamp":1725537575211},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042430"},{"type":"electronic","value":"9783642042447"}],"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-642-04244-7_24","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:17:24Z","timestamp":1252937844000},"page":"289-303","source":"Crossref","is-referenced-by-count":5,"title":["Constraint Representations and Structural Tractability"],"prefix":"10.1007","author":[{"given":"David A.","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Martin J.","family":"Green","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Houghton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Kautz, H.A., Selman, B.: Planning as satisfiability. In: Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359\u2013363 (1992)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","volume":"58","author":"P. Beek van","year":"1992","unstructured":"van Beek, P.: Reasoning about qualitative temporal information. Artificial Intelligence\u00a058, 297\u2013326 (1992)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"24_CR3","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."},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput.\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"24_CR5","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"},{"key":"24_CR6","first-page":"530","volume-title":"DAC 2001: Proceedings of the 38th conference on Design automation","author":"M. Moskewicz","year":"2001","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: DAC 2001: Proceedings of the 38th conference on Design automation, pp. 530\u2013535. ACM, New York (2001)"},{"key":"24_CR7","volume-title":"Handbook of Constraint Programming","author":"W.J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Katriel, I.: Global constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"key":"24_CR8","unstructured":"Graham, M.: On the universal relation. Technical report, University of Toronto (1979)"},{"key":"24_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"24_CR10","unstructured":"Chen, H., Grohe, M.: Constraint satisfaction with succinctly specified relations. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. Number 06401 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2006)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24605-3_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Szeider","year":"2004","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 188\u2013202. Springer, Heidelberg (2004)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/11889205_59","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C. Houghton","year":"2006","unstructured":"Houghton, C., Cohen, D., Green, M.J.: The effect of constraint representation on structural tractability. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 726\u2013730. Springer, Heidelberg (2006)"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206036","volume":"54","author":"M. Grohe","year":"2007","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM\u00a054(1), 1 (2007)","journal-title":"J. ACM"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45578-7_6","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 77\u201392. Springer, Heidelberg (2001)"},{"key":"24_CR15","unstructured":"Katsirelos, G., Bacchus, F.: Generalized NoGoods in CSPs. In: AAAI, pp. 390\u2013396 (2005)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74970-7_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"G. Katsirelos","year":"2007","unstructured":"Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 379\u2013393. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04244-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:41:19Z","timestamp":1552142479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04244-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042430","9783642042447"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04244-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}