{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:05:25Z","timestamp":1740096325016,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_31","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T03:11:01Z","timestamp":1378523461000},"page":"381-397","source":"Crossref","is-referenced-by-count":8,"title":["Solving String Constraints: The Case for Constraint Programming"],"prefix":"10.1007","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"}]},{"given":"Wei Ming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-70583-3_34","volume-title":"Automata, Languages and Programming","author":"R. Axelsson","year":"2008","unstructured":"Axelsson, R., Heljanko, K., Lange, M.: Analyzing context-free grammars using an incremental SAT solver. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 410\u2013422. Springer, Heidelberg (2008)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 107\u2013122. Springer, Heidelberg (2004)"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","volume":"65","author":"C. Bessi\u00e8re","year":"1994","unstructured":"Bessi\u00e8re, C.: Arc-consistency and arc-consistency again. Artificial Intelligence\u00a065(1), 179\u2013190 (1994)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S. Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.-M.: A cost-regular based hybrid column generation approach. Constraints\u00a011(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Fu, X., Powell, M.C., Bantegui, M., Li, C.-C.: Simple linear string constraints. Formal Aspects of Computing (2012), Published on-line in January 2012 and available from \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s00165-011-0214-3\n                    \n                    \n                  . Sushi is available from \n                    \n                      http:\/\/people.hofstra.edu\/Xiang_Fu\/XiangFu\/projects\/SAFELI\/SUSHI.php","DOI":"10.1007\/s00165-011-0214-3"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-73368-3_52","volume-title":"Computer Aided Verification","author":"V. Ganesh","year":"2007","unstructured":"Ganesh, V., Dill, D.L.: A decision procedure for bit-vectors and arrays. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 519\u2013531. Springer, Heidelberg (2007), STP is available from \n                    \n                      https:\/\/sites.google.com\/site\/stpfastprover\/"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-29828-8_13","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"G. Gange","year":"2012","unstructured":"Gange, G., Stuckey, P.J.: Explaining propagators for s-DNNF circuits. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 195\u2013210. Springer, Heidelberg (2012)"},{"key":"31_CR8","unstructured":"Gecode Team. Gecode: A generic constraint development environment (2006), \n                    \n                      http:\/\/www.gecode.org\/"},{"key":"31_CR9","unstructured":"He, J.: Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search. PhD thesis, Uppsala University, Sweden (2013), \n                    \n                      http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:uu:diva-196347"},{"key":"31_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, New York (1979)"},{"issue":"1","key":"31_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10601-009-9073-4","volume":"15","author":"S. Kadio\u011flu","year":"2008","unstructured":"Kadio\u011flu, S., Sellmann, M.: Grammar constraints. Constraints\u00a015(1), 117\u2013144 (2008); An early version is published in the Proceedings of the 23rd AAAI Conference on Artificial Intelligence in 2008","journal-title":"Constraints"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-01929-6_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Reformulating global grammar constraints. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 132\u2013147. Springer, Heidelberg (2009)"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","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. Annals of Operations Research\u00a0184(1), 179\u2013207 (2011), An early version is published in the Proceedings of the 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems in 2008","journal-title":"Annals of Operations Research"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Kie\u017cun, A., Ganesh, V., Guo, P.J., Hooimeijer, P., Ernst, M.D.: HAMPI: A solver for string constraints. In: Proceedings of the 18th International Symposium on Software Testing and Analysis, Chicago, USA, July 2009, pp. 105\u2013116. ACM Press (2009), Hampi is available from \n                    \n                      http:\/\/people.csail.mit.edu\/akiezun\/hampi\/","DOI":"10.1145\/1572272.1572286"},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence\u00a028(2), 225\u2013233 (1986)","journal-title":"Artificial Intelligence"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11889205_64","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C.-G. Quimper","year":"2006","unstructured":"Quimper, C.-G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 751\u2013755. Springer, Heidelberg (2006)"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-74970-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C.-G. Quimper","year":"2007","unstructured":"Quimper, C.-G., Walsh, T.: Decomposing global grammar constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 590\u2013604. Springer, Heidelberg (2007)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: A symbolic execution framework for javascript. In: Proceedings of the 31st IEEE Symposium on Security and Privacy, California, USA, pp. 513\u2013528. IEEE Press (May 2010), Kaluza is available from \n                    \n                      http:\/\/webblaze.cs.berkeley.edu\/2010\/kaluza\/","DOI":"10.1109\/SP.2010.38"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/11889205_38","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M. Sellmann","year":"2006","unstructured":"Sellmann, M.: The theory of grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 530\u2013544. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T22:13:08Z","timestamp":1558044788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}