{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:56Z","timestamp":1740099176915,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008000"},{"type":"electronic","value":"9783030008017"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00801-7_6","type":"book-chapter","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T23:02:38Z","timestamp":1537916558000},"page":"81-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hypertree Decomposition: The First Step Towards Parallel Constraint Solving"],"prefix":"10.1007","author":[{"given":"Ke","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Hofstedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1412228.1412229","volume":"13","author":"G Gottlob","year":"2009","unstructured":"Gottlob, G., Samer, M.: A backtracking-based algorithm for hypertree decomposition. J. Exp. Algorithmics 13, 1 (2009)","journal-title":"J. Exp. Algorithmics"},{"key":"6_CR2","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Advanced parallel algorithms for acyclic conjunctive queries. Technical Report DBAI-TR-98\/18 (1998). \nhttp:\/\/www.dbai.tuwien.ac.at\/staff\/gottlob\/parallel.ps"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/382780.382783","volume":"48","author":"G Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM (JACM) 48(3), 431\u2013498 (2001)","journal-title":"J. ACM (JACM)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Leone, N., Scarcello, F.: Hypertree decompositions: questions and answers. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 57\u201374. ACM (2016)","DOI":"10.1145\/2902251.2902309"},{"key":"6_CR5","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)"},{"key":"6_CR6","unstructured":"Dechter, R., Pearl, J.: The cycle-cutset method for improving search performance in AI applications. In: Third IEEE Conference on AI Applications, pp. 224\u2013230. IEEE (1987)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4615-9385-0_4","volume-title":"Advances in Data Base Theory","author":"M Gyssens","year":"1984","unstructured":"Gyssens, M., Paredaens, J.: A decomposition methodology for cyclic databases. In: Gallaire, H., Nicolas, J., Minker, J. (eds.) Advances in Data Base Theory, vol. 2, pp. 85\u2013122. Plemum Press, New York (1984). \nhttps:\/\/doi.org\/10.1007\/978-1-4615-9385-0_4"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. In: Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 21\u201332. ACM (1999)","DOI":"10.1145\/303976.303979"},{"issue":"2","key":"6_CR9","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. 124(2), 243\u2013282 (2000)","journal-title":"Artif. Intell."},{"key":"6_CR10","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X.: Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2016)"},{"issue":"4","key":"6_CR11","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. J. Comput. Syst. Sci. 66(4), 775\u2013808 (2003)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Declarative Programming and Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00801-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T23:06:09Z","timestamp":1537916769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00801-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008000","9783030008017"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00801-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"INAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications of Declarative Programming and Knowledge Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"inap2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/declare17.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}