{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:20:40Z","timestamp":1648786840492},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-010-0697-y","type":"journal-article","created":{"date-parts":[[2010,2,3]],"date-time":"2010-02-03T23:26:26Z","timestamp":1265239586000},"page":"179-207","source":"Crossref","is-referenced-by-count":6,"title":["The weighted Grammar constraint"],"prefix":"10.1007","volume":"184","author":[{"given":"George","family":"Katsirelos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"697_CR1","first-page":"567","volume-title":"STACS 2000, 17th annual symposium on theoretical aspects of computer science","author":"A. Bertoni","year":"2000","unstructured":"Bertoni, A., Goldwurm, M., & Santini, M. (2000). Random generation and approximate counting of ambiguously described combinatorial structures. In STACS 2000, 17th annual symposium on theoretical aspects of computer science : Vol.\u00a01770 (pp. 567\u2013580). Berlin: Springer."},{"key":"697_CR2","unstructured":"Cote, M. C., Bernard, G., Claude-Guy, Q., & Louis-Martin, R. (2007). Formal languages for integer programming modeling of shift scheduling problems. In TR."},{"key":"697_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., & Marquis, P. (2002). A knowledge compilation map. Journal of Artificial Intelligence Research, 17, 229\u2013264.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"697_CR4","unstructured":"Demassey, S., Pesant, G., & Rousseau, L. M. (2005). Constraint programming based column generation for employee timetabling. In Second international conference, CPAIOR 2005: Vol. 3524\/2005, Prague, Czech Republic (pp.\u00a0140\u2013154)."},{"issue":"4","key":"697_CR5","doi-asserted-by":"crossref","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. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315\u2013333.","journal-title":"Constraints"},{"issue":"2","key":"697_CR6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, 13(2), 94\u2013102.","journal-title":"Communications of the ACM"},{"key":"697_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2006). Translating pseudo-boolean constraints into sat. Journal on Satisfiability, Boolean Modeling and Computation 2, 1\u201326.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"697_CR8","unstructured":"Fargier, H., & Marquis, P. (2007). On valued negation normal form formulas. In M.M. Veloso (Ed.), Proceedings of the 20th international joint conference on artificial intelligence (IJCAI07), Hyderabad, India (pp.\u00a0360\u2013365)."},{"issue":"1","key":"697_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1997.2621","volume":"134","author":"V. Gore","year":"1997","unstructured":"Gore, V., Jerrum, M., Kannan, S., Sweedyk, Z., & Mahaney, S. (1997). A quasi-polynomial-time algorithm for sampling words from a context-free language. Information and Computation, 134(1), 59\u201374.","journal-title":"Information and Computation"},{"key":"697_CR10","volume-title":"Introduction to automata theory, languages, and computation","author":"J. E. Hopcroft","year":"1990","unstructured":"Hopcroft, J. E., & Ullman, J. D. (1990). Introduction to automata theory, languages, and computation. Boston: Addison-Wesley, Longman."},{"key":"697_CR11","unstructured":"Jung, J. C. (2008). Value ordering based on solution counting. PhD thesis, University Nova de Lisboa."},{"key":"697_CR12","unstructured":"Kadioglu, S., & Sellmann, M. (2008). Efficient context-free grammar constraints. In: Proceedings of the 23rd national conference on artificial intelligence (pp. 310\u2013316)."},{"key":"697_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-540-68155-7_31","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 5th international conference, CPAIOR 2008","author":"G. Katsirelos","year":"2008","unstructured":"Katsirelos, G., Narodytska, N., & Walsh, T. (2008). The weighted cfg constraint. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 5th international conference, CPAIOR 2008 : Vol.\u00a05015, Paris, France (pp. 323\u2013327). Berlin: Springer."},{"key":"697_CR14","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-642-04244-7_40","volume-title":"Proceedings of the 15th international conference on principles and practice of constraint programming, CP 2009","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Maneth, S., Narodytska, N., & Walsh, T. (2009). Restricted global grammar constraints. In Proceedings of the 15th international conference on principles and practice of constraint programming, CP 2009 : Vol.\u00a05732, Lisbon, Portugal (pp.\u00a0501\u2013508). Berlin: Springer."},{"key":"697_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-642-04244-7_9","volume-title":"Proceedings of the 15th international conference on principles and practice of constraint programming, CP 2009","author":"J. P. M\u00e9tivier","year":"2009","unstructured":"M\u00e9tivier, J. P., Boizumault, P., & Loudni, S. (2009). Solving nurse rostering problems using soft global constraints. In Proceedings of the 15th international conference on principles and practice of constraint programming, CP 2009 : Vol.\u00a05732, Lisbon, Portugal (pp.\u00a073\u201387). Berlin: Springer."},{"issue":"2","key":"697_CR16","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/78.80816","volume":"39","author":"H. Ney","year":"1991","unstructured":"Ney, H. (1991). Dynamic programming parsing for context-free grammars in continuous speech recognition. IEEE Transactions on Signal Processing, 39(2), 336\u2013340.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"697_CR17","unstructured":"Ossowski, J., & Baier, C. (2006). Symbolic reasoning with weighted and normalized decision diagrams. In: Proceedings of the 12th symposium on the integration of symbolic computation and mechanized reasoning: Vol.\u00a0151 (pp. 39\u201356)."},{"key":"697_CR18","first-page":"482","volume-title":"Proceedings of 10th international conference on principles and practice of constraint programming (CP\u201904)","author":"G. Pesant","year":"2004","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In M. Wallace (Ed.), Proceedings of 10th international conference on principles and practice of constraint programming (CP\u201904) : Vol.\u00a03258 (pp. 482\u2013495). Berlin: Springer."},{"key":"697_CR19","unstructured":"Quimper, C. G., & Louis-Martin, R. (2007). A large neighbourhood search approach to the multi-activity shift scheduling problem. In TR."},{"key":"697_CR20","first-page":"751","volume-title":"Proceedings of the 12th international conference on principles and practice of constraint programming","author":"C. G. Quimper","year":"2006","unstructured":"Quimper, C. G., & Walsh, T. (2006). Global Grammar constraints. In F. Benhamou (Ed.), Proceedings of the 12th international conference on principles and practice of constraint programming : Vol.\u00a04204 (pp.\u00a0751\u2013755). Berlin: Springer."},{"key":"697_CR21","doi-asserted-by":"crossref","unstructured":"Quimper, C. G., & Walsh, T. (2007). Decomposing global grammar constraints. In Proceedings of the 13th international conference on principles and practice of constraint programming, CP 2007.","DOI":"10.1007\/978-3-540-74970-7_42"},{"key":"697_CR22","first-page":"530","volume-title":"Proceedings of the 12th international conference on the principles and practice of constraint programming (CP06)","author":"M. Sellmann","year":"2006","unstructured":"Sellmann, M. (2006). The theory of Grammar constraints. In Proceedings of the 12th international conference on the principles and practice of constraint programming (CP06) : Vol.\u00a04204 (pp. 530\u2013544). Berlin: Springer."},{"key":"697_CR23","volume-title":"Constraint-based local search","author":"P. Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., & Michel, L. (2005). Constraint-based local search. Cambridge: The MIT Press."},{"key":"697_CR24","unstructured":"van Hoeve, W. J. (2009). Soft global constraints, tutorial at principles and practice of constraint programming. In CP\u00a02007, 15th international conference."},{"key":"697_CR25","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and practice of constraint programming\u2014CP 2000, 6th international conference, Singapore","author":"T. Walsh","year":"2000","unstructured":"Walsh, T. (2000). Sat v csp. In R. Dechter (Ed.), Principles and practice of constraint programming\u2014CP 2000, 6th international conference, Singapore : Vol.\u00a01894 (pp. 441\u2013456). Berlin: Springer."},{"key":"697_CR26","unstructured":"Zanarini, A., & Pesant, G. (2007). Solution counting algorithms for constraint-centered search heuristics. In C. Bessiere (Ed.), Principles and practice of constraint programming\u2014CP 2007, 13th international conference: Vol.\u00a04741, Providence, RI, USA. Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0697-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0697-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0697-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T09:31:24Z","timestamp":1590571884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0697-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["697"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0697-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}