{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:06Z","timestamp":1750308006668,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,4,23]],"date-time":"2006-04-23T00:00:00Z","timestamp":1145750400000},"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":[[2006,4,23]]},"DOI":"10.1145\/1141277.1141367","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"394-398","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A new local consistency for weighted CSP dedicated to long domains"],"prefix":"10.1145","author":[{"given":"Matthias","family":"Zytnicki","sequence":"first","affiliation":[{"name":"INRA-BIA, Chemin de Borde-Rouge, Castanet, France"}]},{"given":"Christine","family":"Gaspin","sequence":"additional","affiliation":[{"name":"INRA-BIA, Chemin de Borde-Rouge, Castanet, France"}]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[{"name":"INRA-BIA, Chemin de Borde-Rouge, Castanet, France"}]}],"member":"320","published-online":{"date-parts":[[2006,4,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"230","volume-title":"Proc. PADL 2000","author":"Bistarelli S.","year":"2000","unstructured":"S. Bistarelli , P. Codognet , Y. Georget , and F. Rossi . Labeling and partial local consistency for soft constraint programming . In Proc. PADL 2000 , pages 230 -- 248 , 2000 .]] S. Bistarelli, P. Codognet, Y. Georget, and F. Rossi. Labeling and partial local consistency for soft constraint programming. In Proc. PADL 2000, pages 230--248, 2000.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.09.002"},{"key":"e_1_3_2_1_3_1","first-page":"325","article-title":"Pattern searching\/alignment with RNA primary and secondary structures: an effective descriptor for tRNA","volume":"6","author":"Gautheret D.","year":"1990","unstructured":"D. Gautheret , F. Major , and R. Cedergren . Pattern searching\/alignment with RNA primary and secondary structures: an effective descriptor for tRNA . Comp. Appl. Biosc. , 6 : 325 -- 331 , 1990 .]] D. Gautheret, F. Major, and R. Cedergren. Pattern searching\/alignment with RNA primary and secondary structures: an effective descriptor for tRNA. Comp. Appl. Biosc., 6:325--331, 1990.]]","journal-title":"Comp. Appl. Biosc."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/25.18.3724"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90020-X"},{"key":"e_1_3_2_1_6_1","first-page":"322","volume-title":"Proc. IJCAI 2001","author":"Khatib L.","year":"2001","unstructured":"L. Khatib , P. Morris , R. Morris , and F. Rossi . Temporal constraint reasoning with preferences . In Proc. IJCAI 2001 , pages 322 -- 327 , 2001 .]] L. Khatib, P. Morris, R. Morris, and F. Rossi. Temporal constraint reasoning with preferences. In Proc. IJCAI 2001, pages 322--327, 2001.]]"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. AAAI'02","author":"Larrosa J.","year":"2002","unstructured":"J. Larrosa . Node and arc consistency in weighted CSP . In Proc. AAAI'02 , 2002 .]] J. Larrosa. Node and arc consistency in weighted CSP. In Proc. AAAI'02, 2002.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00108-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.05.004"},{"key":"e_1_3_2_1_10_1","first-page":"232","volume-title":"Proc. IJCAI 1993","author":"Lhomme O.","year":"1993","unstructured":"O. Lhomme . Consistency techniques for numeric CSPs . In Proc. IJCAI 1993 , pages 232 -- 238 , 1993 .]] O. Lhomme. Consistency techniques for numeric CSPs. In Proc. IJCAI 1993, pages 232--238, 1993.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/876889.880418"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647489.727143"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647487.726635"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. IJCAI 1995","author":"Schiex T.","year":"1995","unstructured":"T. Schiex , H. Fargier , and G. Verfaillie . Valued constraint satisfaction problems: Hard and easy problems . In Proc. IJCAI 1995 , 1995 .]] T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In Proc. IJCAI 1995, 1995.]]"}],"event":{"name":"SAC06: The 2006 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Dijon France","acronym":"SAC06"},"container-title":["Proceedings of the 2006 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141277.1141367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:31Z","timestamp":1750259191000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,23]]},"references-count":14,"alternative-id":["10.1145\/1141277.1141367","10.1145\/1141277"],"URL":"https:\/\/doi.org\/10.1145\/1141277.1141367","relation":{},"subject":[],"published":{"date-parts":[[2006,4,23]]},"assertion":[{"value":"2006-04-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}