{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:40:30Z","timestamp":1770972030227,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["DEC-2011\/01\/B\/ST6\/01006"],"award-info":[{"award-number":["DEC-2011\/01\/B\/ST6\/01006"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934510","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"633-641","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Weak consistency notions for all the CSPs of bounded width"],"prefix":"10.1145","author":[{"given":"Marcin","family":"Kozik","sequence":"first","affiliation":[{"name":"Theoretical Computer Science Department, The Faculty of Mathematics and Computer Science, Jagiellonian University"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Journal of Logic and Computation","author":"Barto L.","year":"2014","unstructured":"L. Barto . The collapse of the bounded width hierarchy . Journal of Logic and Computation , 2014 . doi: 10.1093\/logcom\/exu070. 10.1093\/logcom L. Barto. The collapse of the bounded width hierarchy. Journal of Logic and Computation, 2014. doi: 10.1093\/logcom\/exu070."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.32"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.34"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214061"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556646"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.24"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.09.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.059"},{"issue":"5","key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Galois theory for Post algebras. I","author":"Bodnar\u010duk V.G.","year":"1969","unstructured":"V.G. Bodnar\u010duk , L.A. Kalu\u017enin , V.N. Kotov , and B.A. Romov . Galois theory for Post algebras. I , II. Kibernetika (Kiev), (3):1--10; ibid . 1969 , no. 5 , 1 -- 9 , 1969. ISSN 0023-1274. V.G. Bodnar\u010duk, L.A. Kalu\u017enin, V.N. Kotov, and B.A. Romov. Galois theory for Post algebras. I, II. Kibernetika (Kiev), (3):1--10; ibid. 1969, no. 5, 1--9, 1969. ISSN 0023-1274.","journal-title":"II. Kibernetika (Kiev), (3):1--10; ibid"},{"key":"e_1_3_2_1_10_1","volume-title":"Bounded relational width","author":"Bulatov A.","year":"2009","unstructured":"A. Bulatov . Bounded relational width . 2009 . manuscript. A. Bulatov. Bounded relational width. 2009. manuscript."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Comput","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-45022-X_24","volume-title":"Automata, languages and programming (Geneva","author":"Bulatov A. A.","year":"2000","unstructured":"A. A. Bulatov , A. A. Krokhin , and P. Jeavons . Constraint satisfaction problems and finite algebras . In Automata, languages and programming (Geneva , 2000 ), volume 1853 of Lecture Notes in Comput . Sci., pages 272 -- 282 . Springer , Berlin, 2000. A. A. Bulatov, A. A. Krokhin, and P. Jeavons. Constraint satisfaction problems and finite algebras. In Automata, languages and programming (Geneva, 2000), volume 1853 of Lecture Notes in Comput. Sci., pages 272--282. Springer, Berlin, 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exr039"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.11.020"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540090"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-48085-3_12","volume-title":"Principles and Practice of Constraint Programming - CP'99","author":"Dalmau V.","year":"1999","unstructured":"V. Dalmau and J. Pearson . Closure functions and width 1 problems . In J. Jaffar, editor, Principles and Practice of Constraint Programming - CP'99 , volume 1713 of Lecture Notes in Computer Science , pages 159 -- 173 . Springer Berlin Heidelberg , 1999 . ISBN 978-3-540-66626-4. doi: 10.1007\/978-3-540-48085-3_12. 10.1007\/978-3-540-48085-3_12 V. Dalmau and J. Pearson. Closure functions and width 1 problems. In J. Jaffar, editor, Principles and Practice of Constraint Programming - CP'99, volume 1713 of Lecture Notes in Computer Science, pages 159--173. Springer Berlin Heidelberg, 1999. ISBN 978-3-540-66626-4. doi: 10.1007\/978-3-540-48085-3_12."},{"key":"e_1_3_2_1_17_1","first-page":"412","volume-title":"In Proceedings of IJCAI'97","author":"Debruyne R.","year":"1997","unstructured":"R. Debruyne and C. Bessiere . Some practicable filtering techniques for the Constraint Satisfaction Problem . In In Proceedings of IJCAI'97 , pages 412 -- 417 , 1997 . R. Debruyne and C. Bessiere. Some practicable filtering techniques for the Constraint Satisfaction Problem. In In Proceedings of IJCAI'97, pages 412--417, 1997."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_19_1","first-page":"1574","volume-title":"Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set","author":"Guruswami V.","year":"2011","unstructured":"V. Guruswami and Y. Zhou . Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set . In D. Randall, editor, SODA, pages 1574 -- 1589 . SIAM , 2011 . V. Guruswami and Y. Zhou. Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set. In D. Randall, editor, SODA, pages 1574--1589. SIAM, 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-007-2012-6"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"New York NY USA","acronym":"LICS '16","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":20,"alternative-id":["10.1145\/2933575.2934510","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934510","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}