{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:58:05Z","timestamp":1775818685559,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T00:00:00Z","timestamp":1440547200000},"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":["Constraints"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10601-015-9199-5","type":"journal-article","created":{"date-parts":[[2015,8,25]],"date-time":"2015-08-25T03:16:01Z","timestamp":1440472561000},"page":"95-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["General game playing with stochastic CSP"],"prefix":"10.1007","volume":"21","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Koriche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Lagrue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Piette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tabary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,26]]},"reference":[{"issue":"2\u20133","key":"9199_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2\u20133), 235\u2013256.","journal-title":"Machine Learning"},{"key":"9199_CR2","doi-asserted-by":"crossref","unstructured":"Balafoutis, T., & Stergiou, K. (2006). Algorithms for stochastic CSPs. In Proc. of CP\u201906 (pp. 44\u201358).","DOI":"10.1007\/11889205_6"},{"key":"9199_CR3","unstructured":"Bessiere, C., & Verger, G. (2006). Strategic constraint satisfaction problems. In Proc. of CP\u201906 workshop on modelling and reformulation (pp. 17\u201329)."},{"issue":"6218","key":"9199_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1126\/science.1259433","volume":"347","author":"M Bowling","year":"2015","unstructured":"Bowling, M., Burch, N., Johanson, M., & Tammelin, O. (2015). Heads-up limit hold\u2019em poker is solved. Science, 347(6218), 145\u2013149.","journal-title":"Science"},{"issue":"1\u20132","key":"9199_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M Campbell","year":"2002","unstructured":"Campbell, M., Hoane, A.J. Jr., & Hsu, F. (2002). Deep blue. Artificial Intelligence, 134(1\u20132), 57\u201383.","journal-title":"Artificial Intelligence"},{"key":"9199_CR6","unstructured":"Cazenave, T., & Mehat, J. (2010). Ary, a general game playing program. In Proc. of board games studies colloquium."},{"key":"9199_CR7","unstructured":"Clune, J.E. III (2008). Heuristic evaluation functions for general game playing. PhD thesis, University of California, Los Angeles, USA. Adviser-Korf, Richard E."},{"key":"9199_CR8","unstructured":"Debruyne, R., & Bessiere, C. (1997). Some practical filtering techniques for the constraint satisfaction problem. In Proc. of IJCAI\u201997 (pp. 412\u2013417) Springer."},{"key":"9199_CR9","unstructured":"Finnsson, H., & Bj\u00f6rnsson, Y. (2008). Simulation-based approach to general game playing. In Proc. of AAAI\u201908 (pp. 259\u2013264)."},{"issue":"2","key":"9199_CR10","first-page":"62","volume":"26","author":"M Genesereth","year":"2005","unstructured":"Genesereth, M., Love, N., & Pell, B. (2005). General game playing: overview of the AAAI competition. AAAI Magazine, 26(2), 62\u201372.","journal-title":"AAAI Magazine"},{"issue":"6-7","key":"9199_CR11","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.artint.2007.11.003","volume":"172","author":"IP Gent","year":"2008","unstructured":"Gent, I.P., Nightingale, P., Rowley, A., & Stergiou, K. (2008). Solving quantified constraint satisfaction problems. Artificial Intelligence, 172(6-7), 738\u201377.","journal-title":"Artificial Intelligence"},{"key":"9199_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.artint.2012.05.001","volume":"189","author":"B Hnich","year":"2012","unstructured":"Hnich, B., Rossi, R., Tarim, S.A., & Prestwich, S.D. (2012). Filtering algorithms for global chance constraints. Artificial Intelligence, 189, 69\u201394.","journal-title":"Artificial Intelligence"},{"key":"9199_CR13","unstructured":"Koriche, F., Lagrue, S., Piette, \u00c9., & Tabary, S. (2015). Compiling strategic games with complete information into stochastic csps. In AAAI workshop on planning, search, and optimization (PlanSOpt-15)."},{"key":"9199_CR14","unstructured":"Love, N., Hinrichs, T., Haley, D., Schkufza, E., & Genesereth, M. (2008). General game playing: game description language specification. Technical report."},{"key":"9199_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A Mackworth","year":"1977","unstructured":"Mackworth, A. (1977). Consistency in networks of relations. Artificial Intelligence, 8, 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"9199_CR16","unstructured":"Mackworth, A. (1977). On reading sketch maps. In Proc. of IJCAI\u201977 (pp. 598\u2013606). Springer."},{"issue":"1","key":"9199_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s13218-010-0077-4","volume":"25","author":"M M\u00f6ller","year":"2011","unstructured":"M\u00f6ller, M., Schneider, M.T., Wegner, M., & Schaub, T. (2011). Centurio, a general game player: parallel, Java- and ASP-based. K\u00fcnstliche Intelligenz, 25(1), 17\u201324.","journal-title":"K\u00fcnstliche Intelligenz"},{"key":"9199_CR18","doi-asserted-by":"crossref","unstructured":"Neyman, A., & Sorin, S (Eds.) (2003). Stochastic games and applications. Springer.","DOI":"10.1007\/978-94-010-0189-2"},{"key":"9199_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, T.-V.-A., Lallouet, A., & Bordeaux, L. (2013). Constraint games: framework and local search solver. In Proc. of ICTAI\u201913, (pp. 8\u201312).","DOI":"10.1109\/ICTAI.2013.146"},{"key":"9199_CR20","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proc. of CP\u201994 (pp. 10\u201320). Springer.","DOI":"10.1007\/3-540-58601-6_86"},{"key":"9199_CR21","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E. (1997). Understanding and improving the mac algorithm. In Proc. of CP\u201997 (pp. 167\u2013181). Springer.","DOI":"10.1007\/BFb0017438"},{"issue":"5844","key":"9199_CR22","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J Schaeffer","year":"2007","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., & Sutphen, S. (2007). Checkers is solved. Science, 317(5844), 1518\u20131522.","journal-title":"Science"},{"key":"9199_CR23","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C Shannon","year":"1950","unstructured":"Shannon, C. (1950). Programming a computer for playing chess. Philosophical Magazine, 41, 256\u2013275.","journal-title":"Philosophical Magazine"},{"key":"9199_CR24","unstructured":"Shoham, Y., & Leyton-Brown, K (2009). Multiagent systems: algorithmic, game-theoretic, and logical foundations. Cambridge University Press."},{"issue":"4","key":"9199_CR25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/ICG-2008-31402","volume":"31","author":"NR Sturtevant","year":"2008","unstructured":"Sturtevant, N.R. (2008). An analysis of uct in multi-player games. ICGA Journal, 31(4), 195\u2013208.","journal-title":"ICGA Journal"},{"issue":"1","key":"9199_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"A Tarim","year":"2006","unstructured":"Tarim, A., Manandhar, S., & Walsh, T. (2006). Stochastic constraint programming: a scenario-based approach. Constraints, 11(1), 53\u201380.","journal-title":"Constraints"},{"issue":"1\u20132","key":"9199_CR27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(01)00110-2","volume":"134","author":"G Tesauro","year":"2002","unstructured":"Tesauro, G. (2002). Programming backgammon using self-teaching neural nets. Artificial Intelligence, 134(1\u20132), 181\u2013199.","journal-title":"Artificial Intelligence"},{"issue":"4\u20135","key":"9199_CR28","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1017\/S1471068405002358","volume":"5","author":"M Thielscher","year":"2005","unstructured":"Thielscher, M. (2005). Flux: a logic programming method for reasoning agents. Theory and Practice of Logic Programming, 5(4\u20135), 533\u2013565.","journal-title":"Theory and Practice of Logic Programming"},{"key":"9199_CR29","doi-asserted-by":"crossref","unstructured":"Thielscher, M. (2010). A general game description language for incomplete information games. In Proc. of AAAI\u201910 (pp. 994\u2013999).","DOI":"10.1609\/aaai.v24i1.7647"},{"key":"9199_CR30","unstructured":"Walsh, T. (2002). Stochastic constraint programming. In Proc. of ECAI\u201902 (pp. 111\u2013115)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9199-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9199-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9199-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T11:16:01Z","timestamp":1691925361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9199-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,26]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9199"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9199-5","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,26]]}}}