{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:34:00Z","timestamp":1649151240715},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T00:00:00Z","timestamp":1360195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10601-013-9140-8","type":"journal-article","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T04:54:06Z","timestamp":1360126446000},"page":"579-608","source":"Crossref","is-referenced-by-count":1,"title":["View-based propagation of decomposable constraints"],"prefix":"10.1007","volume":"18","author":[{"given":"Marco","family":"Correia","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Barahona","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"key":"9140_CR1","first-page":"661","volume-title":"Proceedings of the 2012 International conference on software engineering, ICSE 2012","author":"D Balasubramaniam","year":"2012","unstructured":"Balasubramaniam, D., Jefferson, C., Kotthoff, L., Miguel, I., Nightingale, P. (2012). An automated approach to generating efficient constraint solvers. In Proceedings of the 2012 International conference on software engineering, ICSE 2012 (pp. 661\u2013671). Piscataway, NJ, USA, IEEE Press."},{"issue":"1","key":"9140_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10009-002-0095-0","volume":"5","author":"T Ball","year":"2003","unstructured":"Ball, T., Podelski, A., Rajamani, S.K. (2003). Boolean and Cartesian abstraction for model checking C programs. International Journal on Software Tools for Technology Transfer (STTT), 5(1):49\u201358.","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"key":"9140_CR3","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X. (2010). Global constraint catalog. The Internet."},{"key":"9140_CR4","unstructured":"Benhamou, F. (1995). Interval constraint logic programming. In Podelski, A. (Ed.), Constraint programming: basics and trends, Lecture Notes in Computer Science (Vol. 910, pp. 1\u201321). Springer."},{"key":"9140_CR5","doi-asserted-by":"crossref","unstructured":"Benhamou, F. (1996). Heterogeneous constraint solving. In Algebraic and logic programming, ALP\u201996, Lecture Notes in Computer Science (Vol. 1139, pp. 62\u201376). Springer-Verlag.","DOI":"10.1007\/3-540-61735-3_4"},{"key":"9140_CR6","unstructured":"Carlson, B. (1995). Compiling and executing finite domain constraints. PhD thesis, Uppsala University."},{"key":"9140_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, K.C.K., & Yap, R.H.C. (2008). Maintaining generalized arc consistency on ad hoc r-ary constraints. In Stuckey, P.J. (Ed.), Principles and practice of constraint programming, CP\u201908, Lecture Notes in Computer Science (Vol. 5202, pp. 509\u2013523). Springer.","DOI":"10.1007\/978-3-540-85958-1_34"},{"key":"9140_CR8","unstructured":"Correia, M. (2010). Modern techniques for constraint solving: The CaSPER experience. PhD thesis, Universidade Nova de Lisboa. Pedro Barahona (superv.)."},{"key":"9140_CR9","doi-asserted-by":"crossref","unstructured":"Correia, M., & Barahona, P. (2008). On the efficiency of impact based heuristics. In Principles and practice of constraint programming, CP\u201908, Lecture Notes in Computer Science (Vol. 5202, pp. 608\u2013612). Springer,","DOI":"10.1007\/978-3-540-85958-1_51"},{"key":"9140_CR10","unstructured":"Correia, M., Barahona, P., Azevedo, F. (2005). CaSPER: A programming environment for development and integration of constraint solvers. In Azevedo, F. (Ed.) Workshop on constraint programming beyond finite integer domains, BeyondFD\u201905."},{"key":"9140_CR11","unstructured":"Frisch, A.M., Grum, M., Jefferson, C., Hernandez, B.M., Miguel, I. (2005). The essence of essence: A constraint language for specifying combinatorial problems. In Proceedings of the 20th international joint conference on artificial intelligence (pp. 73\u201388)."},{"key":"9140_CR12","unstructured":"Gecode (2010). Gecode: Generic constraint development environment. The Internet."},{"key":"9140_CR13","unstructured":"Gent, I.P., Jefferson, C., Miguel, I. (2006). Minion: A fast scalable constraint solver. In European conference on artificial intelligence, ECAI\u201906 (pp. 98\u2013102). IOS Press."},{"key":"9140_CR14","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Jefferson, C., Miguel, I. (2006) Watched literals for constraint propagation in minion. In Benhamou, F. (Ed.) Principles and practice of constraint programming, CP\u201906, Lecture Notes in Computer Science (Vol. 4204, pp. 182\u2013197). Springer.","DOI":"10.1007\/11889205_15"},{"key":"9140_CR15","unstructured":"Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P. (2007). Data structures for generalised arc consistency for extensional constraints. In Conference on artificial intelligence, AAAI\u201907 (pp. 191\u2013197). AAAI Press."},{"key":"9140_CR16","doi-asserted-by":"crossref","unstructured":"Gent, I.P., & Walsh, T. (1999). CSPLib: A benchmark library for constraints. Technical report, APES-09-1999.","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"9140_CR17","unstructured":"Hentenryck, P.V., Saraswat, V., Deville, Y. (1992). Constraint processing in cc(FD). Technical report, Brown University."},{"key":"9140_CR18","unstructured":"ILOG (2003). ILOG S olver 6.0 Reference Manual. ILOG s.a."},{"key":"9140_CR19","unstructured":"Lopez-Ortiz, R., Quimper, C.-G., Tromp, J., Beek, P.V. (2003). A fast and simple algorithm for bounds consistency of the all different constraint. In International joint conference on artificial intelligence, IJCAI\u201903 (pp. 245\u2013250). Morgan Kaufmann Publishers, Inc."},{"key":"9140_CR20","doi-asserted-by":"crossref","unstructured":"Maher, M.J. (2002). Propagation completeness of reactive constraints. In International conference on logic programming, ICLP\u201902, Lecture Notes in Computer Science (Vol. 2401, pp. 148\u2013162). Springer.","DOI":"10.1007\/3-540-45619-8_11"},{"key":"9140_CR21","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G. (2007). Minizinc: Towards a standard CP modelling language. In Bessi\u00e8re, C. (Ed.), Principles and practice of constraint programming, CP\u201907, Lecture Notes in Computer Science (Vol. 4741, pp. 529\u2013543). Springer","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9140_CR22","unstructured":"Rossi, F., Beek, P.V., Walsh, T. (Eds.) (2006). Handbook of constraint programming. Foundations of artificial intelligence. Elsevier Science."},{"key":"9140_CR23","doi-asserted-by":"crossref","unstructured":"Schulte, C., & Stuckey, P.J. (2004). Speeding up constraint propagation. In Principles and practice of constraint programming, CP\u201904, Lecture Notes on Computer Science (Vol. 3258, pp. 619\u2013633). Spinger.","DOI":"10.1007\/978-3-540-30201-8_45"},{"key":"9140_CR24","doi-asserted-by":"crossref","unstructured":"Schulte, C., & Tack, G. (2005). Views and iterators for generic constraint implementations. In Recent advances in constraints, Lecture Notes in Computer Science (Vol. 3978, pp. 118\u2013132). Springer.","DOI":"10.1007\/11564751_71"},{"key":"9140_CR25","unstructured":"Schulte, C., & Tack, G. (2012). View-based propagator derivation. In Constraints (pp. 1\u201333)."},{"key":"9140_CR26","unstructured":"Tack, G. (2009). Constraint propagation\u2014models, techniques, implementation. Doctoral dissertation, Saarland University."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9140-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-013-9140-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9140-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T09:13:47Z","timestamp":1562663627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-013-9140-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,7]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9140"],"URL":"https:\/\/doi.org\/10.1007\/s10601-013-9140-8","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,7]]}}}