{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:52:42Z","timestamp":1725537162129},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041426"},{"type":"electronic","value":"9783642041433"}],"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-04143-3_14","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T13:20:36Z","timestamp":1252934436000},"page":"153-164","source":"Crossref","is-referenced-by-count":0,"title":["Concurrently Decomposable Constraint Systems"],"prefix":"10.1007","author":[{"given":"Cees","family":"Witteveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wiebe","family":"van der Hoek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"14_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(3), 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"key":"14_CR2","unstructured":"Cohen, D.A., Gyssens, M., Jeavons, P.: A unifying theory of structural decompostions for the constraint satisfaction problems. In: Complexity of Constraints. Dagstuhl Seminar Proceedings 06401 (2006)"},{"key":"14_CR3","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers, San Francisco (2003)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artif. Intell.\u00a038(3), 353\u2013366 (1989)","journal-title":"Artif. Intell."},{"key":"14_CR5","first-page":"2000","volume":"124","author":"G. Gottlob","year":"1999","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artificial Intelligence\u00a0124, 2000 (1999)","journal-title":"Artificial Intelligence"},{"key":"14_CR6","unstructured":"Hsu, C.-W., Wah, B.W., Huang, R., Chen, Y.: Constraint partitioning for solving planning problems with trajectory constraints and goal preferences. In: IJCAI, pp. 1924\u20131929 (2007)"},{"key":"14_CR7","unstructured":"Hunsberger, L.: Algorithms for a temporal decoupling problem in multi-agent planning. In: AAAI 2002 (2002)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1412228.1455269","volume":"13","author":"W. Naanaa","year":"2009","unstructured":"Naanaa, W.: A domain decomposition algorithm for constraint satisfaction. J. Exp. Algorithmics\u00a013, 1.13\u20131.23 (2009)","journal-title":"J. Exp. Algorithmics"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/582475.582484","volume":"33","author":"M. Schaefer","year":"2002","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: A compendium. SIGACT News\u00a033(3), 32\u201349 (2002)","journal-title":"SIGACT News"},{"key":"14_CR10","volume-title":"Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations","author":"Y. Shoham","year":"2009","unstructured":"Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. CUP, New York (2009)"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.artint.2005.07.001","volume":"170","author":"B.W. Wah","year":"2006","unstructured":"Wah, B.W., Chen, Y.: Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence\u00a0170(3), 187\u2013231 (2006)","journal-title":"Artificial Intelligence"},{"key":"14_CR12","unstructured":"Yokoo, M., Hirayama, K.: Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: AAMAS1996, pp. 401\u2013408 (1996)"}],"container-title":["Lecture Notes in Computer Science","Multiagent System Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04143-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:31:49Z","timestamp":1552141909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04143-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041426","9783642041433"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04143-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}