{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:06Z","timestamp":1759063506143},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"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,1]]},"DOI":"10.1007\/s10601-012-9133-z","type":"journal-article","created":{"date-parts":[[2012,11,30]],"date-time":"2012-11-30T04:59:14Z","timestamp":1354251554000},"page":"75-107","source":"Crossref","is-referenced-by-count":10,"title":["View-based propagator derivation"],"prefix":"10.1007","volume":"18","author":[{"given":"Christian","family":"Schulte","sequence":"first","affiliation":[]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,1]]},"reference":[{"key":"9133_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"KR Apt","year":"2003","unstructured":"Apt, K.R. (2003). Principles of constraint programming. Cambridge University Press, Cambridge, UK."},{"key":"9133_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W. (2001). Constraint-based scheduling. International series in operations research & management science. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"3","key":"9133_CR3","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M. (1983). On the desirability of acyclic database schemes. Journal of the ACM, 30(3), 479\u2013513.","journal-title":"Journal of the ACM"},{"key":"9133_CR4","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Katriel, I., Thiel, S. (2004). Filtering algorithms for the same constraint. In R\u00e9gin, J.C., & Rueher, M. (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, LNCS, (Vol. 3011, pp. 65\u201379). Springer.","DOI":"10.1007\/978-3-540-24664-0_5"},{"key":"9133_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming languages: Implementations, logics, and programs, LNCS","author":"M Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B. (1997). An open-ended finite domain constraint solver. In Glaser, H., Hartel, P.H., Kuchen, H. (Eds.), Programming languages: Implementations, logics, and programs, LNCS (Vol. 1292, pp. 191\u2013206). Springer, Southampton, UK."},{"key":"9133_CR6","unstructured":"The CHOCO team (2012). CHOCO. http:\/\/www.emn.fr\/z-info\/choco-solver\/ . Accessed Nov 2012."},{"key":"9133_CR7","unstructured":"Choi, C.W., Harvey, W., Lee, J.H.M., Stuckey, P.J. (2006). Finite domain bounds consistency revisited. In Sattar, A., & Kang, B.H. (Eds.), AI 2006: Advances in artificial intelligence, LNCS (Vol. 4304, pp. 49\u201358). Springer."},{"key":"9133_CR8","unstructured":"Correia, M. (2010). Modern techniques for constraint solving: the CaSPER experience. Ph.D. thesis, Universidade Nova de Lisboa."},{"key":"9133_CR9","doi-asserted-by":"crossref","unstructured":"Correia, M., & Barahona, P. (2009). Type parametric compilation of algebraic constraints. In Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (Eds.), EPIA, LNCS (Vol. 5816, pp. 201\u2013212). Springer.","DOI":"10.1007\/978-3-642-04686-5_17"},{"key":"9133_CR10","doi-asserted-by":"crossref","unstructured":"Driesen, K., & H\u00f6lzle, U. (1996). The direct cost of virtual function calls in C+\u2009+. In OOPSLA (pp. 306\u2013323).","DOI":"10.1145\/236337.236369"},{"key":"9133_CR11","unstructured":"The ECL i PS e project (2012). ECL i PS e . www.eclipse-clp.org . Accessed Nov 2012"},{"key":"9133_CR12","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing, LNCS","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2004). An extensible SAT-solver. In Giunchiglia, E., & Tacchella, A., (eds.), Theory and Applications of Satisfiability Testing, LNCS (Vol. 2919, pp. 502\u2013518). Santa Margherita Ligure, Italy: Springer."},{"key":"9133_CR13","doi-asserted-by":"crossref","unstructured":"Feydy, T., & Stuckey, P.J. (2009). Lazy clause generation reengineered. In Gent, I.P. (Ed.), Fifteenth international conference on principles and practice of constraint programming, LNCS (Vol. 5732, pp. 352\u2013366). Springer.","DOI":"10.1007\/978-3-642-04244-7_29"},{"key":"9133_CR14","unstructured":"Gent, I.P., Jefferson, C., Miguel, I. (2006). Minion: A fast scalable constraint solver. In Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (Eds.), ECAI, frontiers in artificial intelligence and applications (Vol. 141, pp. 98\u2013102). IOS Press."},{"key":"9133_CR15","first-page":"182","volume-title":"Twelfth internation conference on principles and practice of constraint programming, LNCS","author":"IP Gent","year":"2006","unstructured":"Gent, I.P., Jefferson, C., Miguel, I. (2006). Watched literals for constraint propagation in Minion. In Benhamou, F. (Ed.), Twelfth internation conference on principles and practice of constraint programming, LNCS (Vol. 4204, pp. 182\u2013197). Nantes, France: Springer."},{"key":"9133_CR16","first-page":"339","volume-title":"International symposium on logic programming","author":"C Gervet","year":"1994","unstructured":"Gervet, C. (1994). Conjunto: Constraint logic programming with finite set domains. In Bruynooghe, M. (Ed.), International symposium on logic programming (pp. 339\u2013358). Ithaca, NY, U.S.A.: MIT Press."},{"key":"9133_CR17","unstructured":"Google (2012). Google or-tools. http:\/\/code.google.com\/p\/or-tools\/ . Accessed Nov 2012."},{"key":"9133_CR18","unstructured":"Gosling, J., Joy, B., Steele, G., Bracha, G. (2005). The Java language specification, 3rd Edn. Addison-Wesley Professional."},{"key":"9133_CR19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"7","author":"W Harvey","year":"2003","unstructured":"Harvey, W., & Stuckey, P.J. (2003). Improving linear constraint propagation by changing constraint representation. Constraints, 7, 173\u2013207.","journal-title":"Constraints"},{"key":"9133_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10462-005-4607-7","volume":"24","author":"P Hawkins","year":"2005","unstructured":"Hawkins, P., Lagoon, V., Stuckey, P.J. (2005). Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research, 24, 109\u2013156.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9133_CR21","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/178243.178478","volume-title":"PLDI \u201994: Proceedings of the ACM SIGPLAN 1994 conference on programming language design and implementation","author":"U H\u00f6lzle","year":"1994","unstructured":"H\u00f6lzle, U., & Ungar, D. (1994). Optimizing dynamically-dispatched calls with run-time type feedback. In PLDI \u201994: Proceedings of the ACM SIGPLAN 1994 conference on programming language design and implementation (pp. 326\u2013336). New York, NY, U.S.A.: ACM. doi: 10.1145\/178243.178478 ."},{"key":"9133_CR22","unstructured":"IBM Corporation (2009). IBM ILOG CP Optimizer V2.3 User\u2019s Manual."},{"key":"9133_CR23","unstructured":"Laburthe, F. (2000). Choco: Implementing a CP kernel. In Beldiceanu, N., Harvey, W., Henz, M., Laburthe, F., Monfroy, E., T. M\u00fcller, Perron, L., Schulte, C. (Eds.), Proceedings of TRICS: Techniques for implementing constraint programming systems, a post-conference workshop of CP 2000 (pp. 71\u201385)."},{"key":"9133_CR24","unstructured":"Lagerkvist, M.Z., & Pesant, G. (2008). Modeling irregular shape placement problems with regular constraints. In First workshop on bin packing and placement constraints BPPC\u201908."},{"key":"9133_CR25","unstructured":"Lagerkvist, M.Z., & Schulte, C. (2009). Propagator groups. In: Gent, I.P. (Ed.), Fifteenth international conference on principles and practice of constraint programming, LNCS (Vol. 5732, pp.\u00a0524\u2013538). Springer."},{"issue":"1","key":"9133_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A Mackworth","year":"1977","unstructured":"Mackworth, A. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"9133_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The definition of standard ML","author":"R Milner","year":"1997","unstructured":"Milner, R., Tofte, M., MacQueen, D. (1997). The definition of standard ML. Cambridge, MA, U.S.A.: MIT Press."},{"key":"9133_CR28","unstructured":"The Mozart Consortium (2012). The Mozart programming system. www.mozart-oz.org . Accessed Nov 2012."},{"issue":"1","key":"9133_CR29","first-page":"1","volume":"13","author":"SL Peyton Jones","year":"2003","unstructured":"Peyton Jones, S.L. (2003). Haskell 98. Journal of Functional Programming, 13(1), 1\u2013255.","journal-title":"Journal of Functional Programming"},{"key":"9133_CR30","unstructured":"Puget, J.F. (1992). PECOS: A high level constraint programming language. In Proceedings of the first Singapore international conference on Intelligent Systems (SPICIS) (pp. 137\u2013142). Singapore."},{"key":"9133_CR31","unstructured":"Puget, J.F. (1994). A C+\u2009+ implementation of CLP. In Proceedings of the second Singapore international conference on intelligent systems (SPICIS) (pp. B256\u2013B261). Singapore."},{"key":"9133_CR32","first-page":"359","volume-title":"Proceedings of the 15th national conference on artificial intelligence","author":"JF Puget","year":"1998","unstructured":"Puget, J.F. (1998). A fast algorithm for the bound consistency of alldiff constraints. In Proceedings of the 15th national conference on artificial intelligence (pp. 359\u2013366). Madison, WI, U.S.A.: AAAI Press."},{"key":"9133_CR33","unstructured":"Quimper, C.G. (2006). Efficient propagators for global constraints. Ph.D. thesis, University of Waterloo, Canada."},{"key":"9133_CR34","first-page":"362","volume-title":"Proceedings of the twelfth national conference on artificial intelligence","author":"JC R\u00e9gin","year":"1994","unstructured":"R\u00e9gin, J.C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the twelfth national conference on artificial intelligence (pp. 362\u2013367). Seattle, WA, USA: AAAI Press."},{"key":"9133_CR35","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S1574-6526(06)80018-0","volume-title":"Handbook of constraint programming","author":"C Schulte","year":"2006","unstructured":"Schulte, C., & Carlsson, M. (2006). Finite domain constraint programming systems. In Rossi, F., van Beek, P., Walsh, T. (Eds.), Handbook of constraint programming (chap.\u00a014, pp. 495\u2013526). Amsterdam, The Netherlands: Elsevier Science Publishers."},{"issue":"3","key":"9133_CR36","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/1065887.1065889","volume":"27","author":"C Schulte","year":"2005","unstructured":"Schulte, C., & Stuckey, P.J. (2005). When do bounds and domain propagation lead to the same search space? Transactions on Programming Languages and Systems, 27(3), 388\u2013425.","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"1","key":"9133_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C Schulte","year":"2008","unstructured":"Schulte, C., & Stuckey, P.J. (2008). Efficient constraint propagation engines. Transactions on Programming Languages and Systems, 31(1), 2:1\u20132:43.","journal-title":"Transactions on Programming Languages and Systems"},{"key":"9133_CR38","doi-asserted-by":"crossref","unstructured":"Schulte, C., & Tack, G. (2009). Weakly monotonic propagators. In Gent, I.P. (Ed.), Fifteenth international conference on principles and practice of constraint programming, LNCS (Vol. 5732, pp. 723\u2013730). Springer.","DOI":"10.1007\/978-3-642-04244-7_56"},{"key":"9133_CR39","unstructured":"Schulte, C., Lagerkvist, M., Tack, G. (2012). Gecode. www.gecode.org . Accessed Nov 2012."},{"key":"9133_CR40","unstructured":"Swedish Institute of Computer Science (2012). SICStus Prolog. www.sics.se\/sicstus\/ . Accessed Nov 2012."},{"issue":"1\u20133","key":"9133_CR41","first-page":"293","volume":"37","author":"P Van Hentenryck","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V.A., Deville, Y. (1998). Design, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming, 37(1\u20133), 293\u2013316.","journal-title":"Journal of Logic Programming"},{"key":"9133_CR42","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P. (2004). O(n log n) filtering algorithms for unary resource constraint. In R\u00e9gin, J.C., & Rueher, M. (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, LNCS (Vol. 3011, pp. 335\u2013347). Springer.","DOI":"10.1007\/978-3-540-24664-0_23"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-012-9133-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-012-9133-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-012-9133-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T07:58:05Z","timestamp":1562399885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-012-9133-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,1]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9133"],"URL":"https:\/\/doi.org\/10.1007\/s10601-012-9133-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,1]]}}}