{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:41Z","timestamp":1750307261084,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["05\/IN\/I886"],"award-info":[{"award-number":["05\/IN\/I886"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982382","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"901-906","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences"],"prefix":"10.1145","author":[{"given":"Emanuele","family":"Di Rosa","sequence":"first","affiliation":[{"name":"University of Genoa, Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Giunchiglia","sequence":"additional","affiliation":[{"name":"University of Genoa, Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O'Sullivan","sequence":"additional","affiliation":[{"name":"University College Cork, Cork, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_76"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9095-y"},{"key":"e_1_3_2_1_4_1","first-page":"510","volume-title":"Proc. ECAI'08","author":"Di Rosa E.","unstructured":"E. Di Rosa , E. Giunchiglia , and M. Maratea , ' A new approach for solving satisfiability problems with qualitative preferences ', in Proc. ECAI'08 , pp. 510 -- 514 . E. Di Rosa, E. Giunchiglia, and M. Maratea, 'A new approach for solving satisfiability problems with qualitative preferences', in Proc. ECAI'08, pp. 510--514."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/09528130903010212"},{"volume-title":"Proc. SAT'04","author":"Sang T.","key":"e_1_3_2_1_6_1","unstructured":"T. Sang , F. Bacchus , P. Beame , H. Kautz , and T. Pitassi , ' Combining component caching and clause learning for effective model counting ', in Proc. SAT'04 . T. Sang, F. Bacchus, P. Beame, H. Kautz, and T. Pitassi, 'Combining component caching and clause learning for effective model counting', in Proc. SAT'04."},{"key":"e_1_3_2_1_7_1","first-page":"502","volume-title":"Proc. SAT'03","author":"E\u00e9n N.","unstructured":"N. E\u00e9n and N. S\u00f6rensson , ' An extensible SAT-solver ', in Proc. SAT'03 , pp. 502 -- 518 . N. E\u00e9n and N. S\u00f6rensson, 'An extensible SAT-solver', in Proc. SAT'03, pp. 502--518."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1210590"}],"event":{"name":"SAC'11: The 2011 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"TaiChung Taiwan","acronym":"SAC'11"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:37Z","timestamp":1750243957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":8,"alternative-id":["10.1145\/1982185.1982382","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982382","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}