{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:45Z","timestamp":1750307085890,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2480362.2480385","type":"proceedings-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:45Z","timestamp":1367437665000},"page":"104-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving equations on words through boolean satisfiability"],"prefix":"10.1145","author":[{"given":"Micha\u00ebl","family":"Larouche","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre Blondin","family":"Mass\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Gaboury","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Hall\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Theoretical Computer Science","author":"Blondin Mass\u00e9 A.","year":"2012","unstructured":"A. Blondin Mass\u00e9 , A. Garon , and S. Labb\u00e9 . Generation of double square tiles . Theoretical Computer Science , 2012 . To appear. A. Blondin Mass\u00e9, A. Garon, and S. Labb\u00e9. Generation of double square tiles. Theoretical Computer Science, 2012. To appear."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572286"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796529"}],"event":{"name":"SAC '13: SAC '13","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Coimbra Portugal","acronym":"SAC '13"},"container-title":["Proceedings of the 28th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480362.2480385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:22Z","timestamp":1750239262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":4,"alternative-id":["10.1145\/2480362.2480385","10.1145\/2480362"],"URL":"https:\/\/doi.org\/10.1145\/2480362.2480385","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}