{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:10Z","timestamp":1725535810005},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"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-02029-2_9","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"87-99","source":"Crossref","is-referenced-by-count":4,"title":["HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Marnette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley, Reading (1995)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Adler, I., Gottlob, G., Grohe, M.: Hypertree-width and related hypergraph invariants. In: Proc. of EUROCOMB 2005, pp. 5\u201310 (2005)","DOI":"10.46298\/dmtcs.3424"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11564751_15","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"H. Chen","year":"2005","unstructured":"Chen, H., Dalmau, V.: Beyond hypertree width: Decomposition methods without decompositions. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 167\u2013181. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0004-3702(92)90043-W","volume":"55","author":"R. Dechter","year":"1992","unstructured":"Dechter, R.: From local to global consistency. Artificial Intelligence\u00a055(1), 87\u2013108 (1992)","journal-title":"Artificial Intelligence"},{"key":"9_CR5","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J. Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. Journal of the ACM\u00a049(6), 716\u2013752 (2002)","journal-title":"Journal of the ACM"},{"issue":"2","key":"9_CR7","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. Artificial Intelligence\u00a0124(2), 243\u2013282 (2000)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Miklos, Z., Schwentick, T.: Generalized hypertree decompositions: Np-hardness and tractable variants. In: Proc. of PODS 2007 (2007)","DOI":"10.1145\/1265530.1265533"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-540-70575-8_60","volume-title":"Automata, Languages and Programming","author":"G. Greco","year":"2008","unstructured":"Greco, G., Scarcello, F.: Tree projections: Hypergraph games and minimality. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 736\u2013747. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"Gyssens, M., Jeavons, P., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence\u00a066(1), 57\u201389 (1994)","journal-title":"Artificial Intelligence"},{"issue":"1-3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0012-365X(92)90282-K","volume":"109","author":"P. Hell","year":"1992","unstructured":"Hell, P., Nesetril, J.: The core of a graph. Discrete Math.\u00a0109(1-3), 117\u2013126 (1992)","journal-title":"Discrete Math."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"P.G. Kolaitis","year":"1998","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences\u00a061(2), 302\u2013332 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR14","unstructured":"Kolaitis, P.G., Vardi, M.Y.: A game-theoretic approach to constraint satisfaction. In: Proc. of AAAI 2000, pp. 175\u2013181 (2000)"},{"key":"9_CR15","unstructured":"Pearson, J., Jeavons, P.: A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Holloway, University of London (July 1997)"},{"key":"9_CR16","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proc. of VLDB 1981, pp. 82\u201394 (1981)"}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T03:16:53Z","timestamp":1633749413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}