{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T18:02:17Z","timestamp":1709834537478},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T00:00:00Z","timestamp":1369785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10732-013-9222-1","type":"journal-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T09:21:29Z","timestamp":1369732889000},"page":"729-756","source":"Crossref","is-referenced-by-count":3,"title":["Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint"],"prefix":"10.1007","volume":"19","author":[{"given":"Jun","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,29]]},"reference":[{"key":"9222_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K Apt","year":"2003","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"9222_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) Proceedings of CP\u201904, volume 3258 of LNCS, pp. 107\u2013122. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30201-8_11"},{"issue":"1","key":"9222_CR3","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/s10601-012-9134-y","volume":"18","author":"N Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J.: On matrices, automata, and double counting in constraint programming. Constraints 18(1), 108\u2013140 (2013)","journal-title":"Constraints"},{"issue":"2\u20133","key":"9222_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3233\/FI-2011-401","volume":"107","author":"J He","year":"2011","unstructured":"He, J., Flener, P., Pearson, J.: An automaton constraint for local search. Fundam. Inform. 107(2\u20133), 223\u2013248 (2011)","journal-title":"Fundam. Inform."},{"key":"9222_CR5","doi-asserted-by":"crossref","unstructured":"Kadio\u01e7lu, S., Sellmann, M.: Grammar constraints. Constraints 15(1), 117\u2013144 (2010)","DOI":"10.1007\/s10601-009-9073-4"},{"key":"9222_CR6","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: The weighted CFG constraint. In: Perron, L., Trick, M. (eds.) Proceedings of CP-AI-OR\u201908, volume 5015 of LNCS, pp. 323\u2013327. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-68155-7_31"},{"key":"9222_CR7","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Maneth, S., Narodytska, N., Walsh, T.: Restricted global grammar constraints. In: Gent, I.P. (ed.) Proceedings of CP\u201909, volume 5732 of LNCS, pp. 501\u2013508. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04244-7_40"},{"key":"9222_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10479-010-0697-y","volume":"184","author":"G Katsirelos","year":"2011","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: The weighted grammar constraint. Ann. Oper. Res. 184, 179\u2013207 (2011)","journal-title":"Ann. Oper. Res."},{"key":"9222_CR9","doi-asserted-by":"crossref","unstructured":"Menana, J., Demassey, S.: Sequencing and counting with the multicost-regular constraint. In: van Hoeve, W.-J., Hooker, J.N. (eds.) Proceedings of CP-AI-OR\u201909, volume 5547 of LNCS, pp. 178\u2013192. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01929-6_14"},{"key":"9222_CR10","doi-asserted-by":"crossref","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) Proceedings of CP\u201904, volume 3258 of LNCS, pp. 482\u2013495. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9222_CR11","unstructured":"Pralong, B.: Impl\u00e9mentation de la contrainte Regular en Comet. Master\u2019s Thesis, \u00c9cole Polytechnique de Montr\u00e9al, Canada (2007)"},{"key":"9222_CR12","doi-asserted-by":"crossref","unstructured":"Quimper, C.-G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) Proceedings of CP\u201906, volume 4204 of LNCS, pp. 751\u2013755. Springer, Berlin (2006)","DOI":"10.1007\/11889205_64"},{"issue":"1\u20133","key":"9222_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Inf. Control 64(1\u20133), 100\u2013118 (1985)","journal-title":"Inf. Control"},{"key":"9222_CR14","volume-title":"Constraint-based Local Search","author":"P Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-based Local Search. MIT Press, Cambridge (2005)"},{"key":"9222_CR15","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M.: On global warming (Softening global constraints). In: Proceedings of the 6th International Workshop on Preferences and Soft Constraints, available at http:\/\/www.andrew.cmu.edu\/user\/vanhoeve\/papers\/softglob.pdf (2004). Accessed 16 May 2013"},{"issue":"4\u20135","key":"9222_CR16","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"W-J Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M.: On global warming: flow-based soft global constraints. J. Heuristics 12(4\u20135), 347\u2013373 (2006)","journal-title":"J. Heuristics"},{"key":"9222_CR17","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21, 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"9222_CR18","doi-asserted-by":"crossref","unstructured":"Zanarini, A., Milano, M., Pesant, G.: Improved algorithm for the soft global cardinality constraint. In: Beck, J.C., Smith, B. (eds.) Proceedings of CP-AI-OR\u201906, volume 3990 of LNCS, pp. 288\u2013299. Springer, Berlin (2006)","DOI":"10.1007\/11757375_23"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9222-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9222-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9222-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T05:55:35Z","timestamp":1595829335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9222-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,29]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9222"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9222-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,29]]}}}