{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:16:48Z","timestamp":1755800208112,"version":"3.44.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,26]]},"DOI":"10.1109\/cog64752.2025.11114136","type":"proceedings-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T18:06:42Z","timestamp":1755626802000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Propagation for Reasoning in Single-Player Deduction Games"],"prefix":"10.1109","author":[{"given":"Fandi","family":"Meng","sequence":"first","affiliation":[{"name":"Queen Mary University of London,Game AI Research Group,London,United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaijie","family":"Xu","sequence":"additional","affiliation":[{"name":"McGill University,Department of Computer Science,Montreal,Quebec,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Lucas","sequence":"additional","affiliation":[{"name":"Queen Mary University of London,Game AI Research Group,London,United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CoG60054.2024.10645614"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/40"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-34017-8_6"},{"volume-title":"Finding friend and foe in avalon with counterfactual regret minimization and deep networks","year":"2019","author":"Serrino","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICIST55546.2022.9926961"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/852"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/44418.44421"},{"volume-title":"Fastermind: Using a sat-solver to play mastermind more efficiently","year":"2018","author":"Collina","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2019.8848086"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48899-7_3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2005-28105"},{"volume-title":"An exact and interpretable solution to wordle","year":"2022","author":"Bertsimas","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3723498.3723830"}],"event":{"name":"2025 IEEE Conference on Games (CoG)","start":{"date-parts":[[2025,8,26]]},"location":"Lisbon, Portugal","end":{"date-parts":[[2025,8,29]]}},"container-title":["2025 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11113832\/11113841\/11114136.pdf?arnumber=11114136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T06:43:46Z","timestamp":1755672226000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11114136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,26]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cog64752.2025.11114136","relation":{},"subject":[],"published":{"date-parts":[[2025,8,26]]}}}