{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:14Z","timestamp":1750307594008,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["133568"],"award-info":[{"award-number":["133568"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,22]]},"DOI":"10.1145\/1774088.1774525","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"2073-2074","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Relational consistency by constraint filtering"],"prefix":"10.1145","author":[{"given":"Shant","family":"Karakashian","sequence":"first","affiliation":[{"name":"University of Nebraska-Lincoln"}]},{"given":"Robert J.","family":"Woodward","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln"}]},{"given":"Berthe Y.","family":"Choueiry","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln"}]},{"given":"Christian","family":"Bessiere","sequence":"additional","affiliation":[{"name":"LIRMM-CNRS University Montpellier, France"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.02.004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.10.016"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_34"},{"key":"e_1_3_2_1_4_1","volume-title":"Constraint Processing. Morgan Kaufmann","author":"Dechter R.","year":"2003","unstructured":"R. Dechter . Constraint Processing. Morgan Kaufmann , 2003 . R. Dechter. Constraint Processing. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)86737-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/5236.5237"},{"key":"e_1_3_2_1_7_1","first-page":"114","volume-title":"On the Consistency of General Constraint-Satisfaction Problems. In AAAI 1993","author":"J\u00e9gou P.","year":"1993","unstructured":"P. J\u00e9gou . On the Consistency of General Constraint-Satisfaction Problems. In AAAI 1993 , pages 114 -- 119 , 1993 . P. J\u00e9gou. On the Consistency of General Constraint-Satisfaction Problems. In AAAI 1993, pages 114--119, 1993."},{"key":"e_1_3_2_1_8_1","first-page":"405","volume-title":"R\u00e9gin. A Fast Arc Consistency Algorithm For N-Ary Constraints. In AAAI 2005","author":"Lhomme O.","year":"2005","unstructured":"O. Lhomme and J.- C. R\u00e9gin. A Fast Arc Consistency Algorithm For N-Ary Constraints. In AAAI 2005 , pages 405 -- 410 , 2005 . O. Lhomme and J.-C. R\u00e9gin. A Fast Arc Consistency Algorithm For N-Ary Constraints. In AAAI 2005, pages 405--410, 2005."},{"key":"e_1_3_2_1_9_1","volume-title":"Consistency in Networks of Relations. Artificial Intelligence, 8:99--118","author":"Mackworth A. K.","year":"1977","unstructured":"A. K. Mackworth . Consistency in Networks of Relations. Artificial Intelligence, 8:99--118 , 1977 . A. K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99--118, 1977."},{"key":"e_1_3_2_1_10_1","first-page":"651","volume":"88","author":"Mohr R.","year":"1988","unstructured":"R. Mohr and G. Masini . Good Old Discrete Relaxation. In ECAI 88 , pages 651 -- 656 , 1988 . R. Mohr and G. Masini. Good Old Discrete Relaxation. In ECAI 88, pages 651--656, 1988.","journal-title":"Good Old Discrete Relaxation. In ECAI"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(74)90008-5"},{"key":"e_1_3_2_1_12_1","first-page":"641","volume":"24","author":"Stergiou K.","year":"1998","unstructured":"K. Stergiou and N. Samaras . Binary Encodings of Non-binary Constraint Satisfaction Problems : Algorithms and Experimental Results. JAIR , 24 : 641 -- 684 , 1998 . K. Stergiou and N. Samaras. Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results. JAIR, 24:641--684, 1998.","journal-title":"Algorithms and Experimental Results. JAIR"}],"event":{"name":"SAC'10: The 2010 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Sierre Switzerland","acronym":"SAC'10"},"container-title":["Proceedings of the 2010 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1774088.1774525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:34Z","timestamp":1750250494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":12,"alternative-id":["10.1145\/1774088.1774525","10.1145\/1774088"],"URL":"https:\/\/doi.org\/10.1145\/1774088.1774525","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}