{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:28:04Z","timestamp":1725863284905},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449524"},{"type":"electronic","value":"9783319449531"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_26","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"405-420","source":"Crossref","is-referenced-by-count":6,"title":["Learning Parameters for the Sequence Constraint from Solutions"],"prefix":"10.1007","author":[{"given":"\u00c9milie","family":"Picard-Cantin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Bouchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Sweeney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"12","key":"26_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in chip. Math. Comput. Model. 20(12), 97\u2013123 (1994)","journal-title":"Math. Comput. Model."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/978-3-642-23786-7_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"N Beldiceanu","year":"2011","unstructured":"Beldiceanu, N., Simonis, H.: A constraint seeker: finding and ranking global constraints from examples. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 12\u201326. Springer, Heidelberg (2011)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 141\u2013157. Springer, Heidelberg (2012)"},{"key":"26_CR4","unstructured":"Bessiere, C., Coletta, R., Hebrard, E., Katsirelos, G., Lazaar, N., Narodytska, N., Quimper, C.G., Walsh, T.: Constraint acquisition via partial queries. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pp. 475\u2013481. AAAI Press (2013)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/11564096_8","volume-title":"Machine Learning: ECML 2005","author":"C Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., Coletta, R., Koriche, F., O\u2019Sullivan, B.: A SAT-based version space algorithm for acquiring constraint satisfaction problems. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 23\u201334. Springer, Heidelberg (2005)"},{"key":"26_CR6","unstructured":"Bessiere, C., Coletta, R., Koriche, F., O\u2019Sullivan, B.: Acquiring constraint networks using a sat-based version space algorithm. In: Proceedings of the 21st National Conference on Artificial Intelligence, no. 2, pp. 1565\u20131568. AAAI Press (2006)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-540-73580-9_9","volume-title":"Abstraction, Reformulation, and Approximation","author":"C Bessiere","year":"2007","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., Walsh, T.: Reformulating global constraints: the Slide and Regular constraints. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol. 4612, pp. 80\u201392. Springer, Heidelberg (2007)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., O\u2019Sullivan, B.: Constraint acquisition. Artificial Intelligence (2015, In Press)","DOI":"10.1016\/j.artint.2015.08.001"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P., Walsh, T.: Encodings of the sequence constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Coletta, R., Bessiere, C., O\u2019Sullivan, B., Freuder, E.C., O\u2019Connell, S., Quinqueton, J.: Constraint acquisition as semi-automatic modeling. In: Proceedings of the 23rd SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (AI 2003), pp. 111\u2013124. Springer, London (2004)","DOI":"10.1007\/978-0-85729-412-8_9"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1007\/11889205_44","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"W-J Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: Revisiting the sequence constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 620\u2013634. Springer, Heidelberg (2006)"},{"key":"26_CR12","volume-title":"Introduction to the Design and Analysis of Algorithms","author":"A Levitin","year":"2011","unstructured":"Levitin, A.: Introduction to the Design and Analysis of Algorithms. Pearson Education, Newmarket (2011)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-3-540-45240-9_31","volume-title":"Applications and Science in Soft Computing","author":"S O\u2019Connell","year":"2004","unstructured":"O\u2019Connell, S., O\u2019Sullivan, B., Freuder, E.C.: A study of query generation strategies for interactive constraint acquisition. In: Bessi\u00e8re, C. (ed.) Applications and Science in Soft Computing. LNCS, vol. 4741, pp. 225\u2013232. Springer, Heidelberg (2004)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"26_CR15","unstructured":"Pesant, G.: Counting solutions of csps: a structural approach. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 260\u2013265. Morgan Kaufmann Publishers Inc. (2005)"},{"key":"26_CR16","unstructured":"R\u00e9gin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), vol. 1, pp. 209\u2013215. AAAI Press (1996)"},{"key":"26_CR17","volume-title":"Introduction to Probability Models","author":"SM Ross","year":"2014","unstructured":"Ross, S.M.: Introduction to Probability Models. Elsevier, Oxford (2014)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than coppersmith-winograd. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012), pp. 887\u2013898. ACM (2012)","DOI":"10.1145\/2213977.2214056"},{"issue":"3","key":"26_CR19","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/s10601-008-9065-9","volume":"14","author":"A Zanarini","year":"2009","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints 14(3), 392\u2013413 (2009)","journal-title":"Constraints"}],"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-319-44953-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:52Z","timestamp":1498324072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}