{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:18Z","timestamp":1725537198061},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"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-04027-6_8","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"71-85","source":"Crossref","is-referenced-by-count":3,"title":["Tree-Width for First Order Formulae"],"prefix":"10.1007","author":[{"given":"Isolde","family":"Adler","sequence":"first","affiliation":[]},{"given":"Mark","family":"Weyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.20025","volume":"47","author":"I. Adler","year":"2004","unstructured":"Adler, I.: Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory\u00a047, 275\u2013296 (2004)","journal-title":"Journal of Graph Theory"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.jctb.2006.12.006","volume":"97","author":"I. Adler","year":"2007","unstructured":"Adler, I.: Directed tree-width examples. J. Comb. Theory, Ser. B\u00a097(5), 718\u2013725 (2007)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1137\/050623395","volume":"22","author":"I. Adler","year":"2008","unstructured":"Adler, I.: Tree-related widths of graphs and hypergraphs. SIAM J. Discrete Math.\u00a022(1), 102\u2013123 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR4","first-page":"311","volume-title":"PODS","author":"I. Adler","year":"2008","unstructured":"Adler, I.: Tree-width and functional dependencies in databases. In: Lenzerini, M., Lembo, D. (eds.) PODS, pp. 311\u2013320. ACM, New York (2008)"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","first-page":"77","volume-title":"STOC","author":"A.K. Chandra","year":"1977","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC, pp. 77\u201390. ACM, New York (1977)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C. Chekuri","year":"2000","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theor. Comput. Sci.\u00a0239(2), 211\u2013229 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11538363_17","volume-title":"Computer Science Logic","author":"H. Chen","year":"2005","unstructured":"Chen, H., Dalmau, V.: From pebble games to tractability: An ambidextrous consistency algorithm for quantified constraint satisfaction. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 232\u2013247. Springer, Heidelberg (2005)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-46135-3_21","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"V. Dalmau","year":"2002","unstructured":"Dalmau, V., Kolaitis, P.G., Y. Vardi, M.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 310\u2013326. Springer, Heidelberg (2002)"},{"key":"8_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"8_CR11","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1990","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1990)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput.\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"8_CR13","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. J. ACM\u00a049(6), 716\u2013752 (2002)","journal-title":"J. ACM"},{"key":"8_CR14","volume-title":"Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, Secaucus (2006)"},{"key":"8_CR15","volume-title":"Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, Secaucus (2006)"},{"unstructured":"Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: AAAI, pp. 4\u20139 (1990)","key":"8_CR16"},{"key":"8_CR17","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, 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/S0022-0000(03)00030-8","volume":"66","author":"G. Gottlob","year":"2003","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences\u00a066, 775\u2013808 (2003)","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Gottlob, G., Greco, G., Scarcello, F.: The complexity of quantified constraint satisfaction problems under structural restrictions. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 150\u2013155. Professional Book Center (2005)","key":"8_CR19"},{"doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proceedings of the of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (2006) (to appear)","key":"8_CR20","DOI":"10.1145\/1109557.1109590"},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"P.G. Kolaitis","year":"2000","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci.\u00a061(2), 302\u2013332 (2000)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Ordyniak, S.: Digraph decompositions and monotonicity in digraph searching. In: CoRR, abs\/0802.2228 (2008)","key":"8_CR22","DOI":"10.1007\/978-3-540-92248-3_30"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P.D. Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. Journal of Combinatorial Theory, Series B\u00a058, 22\u201333 (1993)","journal-title":"Journal of Combinatorial Theory, Series B"},{"doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On the complexity of bounded-variable queries (extended abstract), pp. 266\u2013276 (1995)","key":"8_CR24","DOI":"10.1145\/212433.212474"},{"key":"8_CR25","first-page":"82","volume-title":"VLDB","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB, pp. 82\u201394. IEEE Computer Society, Los Alamitos (1981)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:19:19Z","timestamp":1558538359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}