{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:38:56Z","timestamp":1777559936452,"version":"3.51.4"},"reference-count":26,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIC"],"published-print":{"date-parts":[[2017,8,31]]},"DOI":"10.3233\/aic-170740","type":"journal-article","created":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T11:26:32Z","timestamp":1502450792000},"page":"325-346","source":"Crossref","is-referenced-by-count":0,"title":["Generalized support and formal development of constraint propagators"],"prefix":"10.1177","volume":"30","author":[{"given":"James","family":"Caldwell","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Wyoming, 1000 E. University Ave., Laramie, WY 82071-3315, USA. E-mail:\u00a0jlc@cs.uwyo.edu"}]},{"given":"Ian P.","family":"Gent","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of St Andrews, St Andrews, Fife KY16 9SX, UK. E-mails:\u00a0ian.gent@st-andrews.ac.uk,\u00a0pwn1@st-andrews.ac.uk"}]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of St Andrews, St Andrews, Fife KY16 9SX, UK. E-mails:\u00a0ian.gent@st-andrews.ac.uk,\u00a0pwn1@st-andrews.ac.uk"}]}],"member":"179","reference":[{"key":"10.3233\/AIC-170740_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320"},{"key":"10.3233\/AIC-170740_ref2","doi-asserted-by":"crossref","unstructured":"K.R.\u00a0Apt and E.\u00a0Monfroy, Automatic generation of constraint propagation algorithms for small finite domains, in: Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming (CP 1999), 1999, pp.\u00a058\u201372.","DOI":"10.1007\/978-3-540-48085-3_5"},{"key":"10.3233\/AIC-170740_ref3","doi-asserted-by":"crossref","unstructured":"N.\u00a0Beldiceanu, M.\u00a0Carlsson, P.\u00a0Flener, M.A.F.\u00a0Rodr\u00edguez and J.\u00a0Pearson, Linking prefixes and suffixes for constraints encoded using automata with accumulators, in: Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP 2014), 2014, pp.\u00a0142\u2013157.","DOI":"10.1007\/978-3-319-10428-7_13"},{"key":"10.3233\/AIC-170740_ref4","doi-asserted-by":"crossref","unstructured":"N.\u00a0Beldiceanu, M.\u00a0Carlsson and T.\u00a0Petit, Deriving filtering algorithms from constraint checkers, in: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), 2004, pp.\u00a0107\u2013122.","DOI":"10.1007\/978-3-540-30201-8_11"},{"key":"10.3233\/AIC-170740_ref5","doi-asserted-by":"crossref","unstructured":"C.\u00a0Bessi\u00e8re, Constraint propagation, in: Handbook of Constraint Programming, P.\u00a0van Beek, F.\u00a0Rossi and T.\u00a0Walsh, eds, Elsevier, 2006, pp.\u00a029\u201383.","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"10.3233\/AIC-170740_ref6","doi-asserted-by":"crossref","unstructured":"C.\u00a0Bessiere, E.\u00a0Hebrard, B.\u00a0Hnich and T.\u00a0Walsh, The tractability of global constraints, in: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), 2004, pp.\u00a0716\u2013720.","DOI":"10.1007\/978-3-540-30201-8_53"},{"key":"10.3233\/AIC-170740_ref7","unstructured":"C.\u00a0Bessi\u00e8re and J.-C.\u00a0R\u00e9gin, Arc consistency for general constraint networks: Preliminary results, in: Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI 97), 1997, pp.\u00a0398\u2013404."},{"key":"10.3233\/AIC-170740_ref8","unstructured":"C.\u00a0Bessi\u00e8re and J.-C.\u00a0R\u00e9gin, Refining the basic constraint propagation algorithm, in: Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), 2001, pp.\u00a0309\u2013315."},{"issue":"1\u20132","key":"10.3233\/AIC-170740_ref9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(99)00170-X","article-title":"Search algorithms in type theory","volume":"232","author":"Caldwell","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/AIC-170740_ref10","doi-asserted-by":"crossref","unstructured":"D.A.\u00a0Cohen, C.\u00a0Jefferson and K.E.\u00a0Petrie, A theoretical framework for constraint propagator triggering, in: Proceedings of the Ninth International Symposium on Combinatorial Search, 2016, pp.\u00a019\u201327.","DOI":"10.1609\/socs.v7i1.18388"},{"key":"10.3233\/AIC-170740_ref11","doi-asserted-by":"crossref","unstructured":"R.L.\u00a0Constable, Naive computational type theory, in: Proof and System Reliability, H.\u00a0Schwichtenberg and R.\u00a0Steinbruggen, eds, Nato Science Series, Vol.\u00a062, Kluwer, 2002, pp.\u00a0213\u2013259.","DOI":"10.1007\/978-94-010-0413-8_7"},{"key":"10.3233\/AIC-170740_ref12","unstructured":"R.L.\u00a0Constable, S.F.\u00a0Allen, H.M.\u00a0Bromley, W.R.\u00a0Cleaveland, J.F.\u00a0Cremer, R.W.\u00a0Harper, D.J.\u00a0Howe, T.B.\u00a0Knoblock, N.P.\u00a0Mendler, P.\u00a0Panangaden, J.T.\u00a0Sasaki and S.F.\u00a0Smith, Implementing Mathematics with the Nuprl Proof Development System, Prentice Hall, 1986."},{"key":"10.3233\/AIC-170740_ref13","doi-asserted-by":"crossref","unstructured":"E.C.\u00a0Freuder and A.K.\u00a0Mackworth, Constraint satisfaction: An emerging paradigm, in: Handbook of Constraint Programming, F.\u00a0Rossi, P.\u00a0Van Beek and T.\u00a0Walsh, eds, Elsevier, 2006, pp.\u00a013\u201328.","DOI":"10.1016\/S1574-6526(06)80006-4"},{"key":"10.3233\/AIC-170740_ref14","unstructured":"I.P.\u00a0Gent, C.\u00a0Jefferson and I.\u00a0Miguel, MINION: A fast, scalable, constraint solver, in: Proceedings 17th European Conference on Artificial Intelligence (ECAI 2006), 2006, pp.\u00a098\u2013102."},{"key":"10.3233\/AIC-170740_ref15","doi-asserted-by":"crossref","unstructured":"I.P.\u00a0Gent, C.\u00a0Jefferson and I.\u00a0Miguel, Watched literals for constraint propagation in Minion, in: Proc. 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 2006, pp.\u00a0182\u2013197.","DOI":"10.1007\/11889205_15"},{"issue":"18","key":"10.3233\/AIC-170740_ref16","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1016\/j.artint.2008.10.006","article-title":"Generalised arc consistency for the AllDifferent constraint: An empirical survey","volume":"172","author":"Gent","year":"2008","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-170740_ref17","unstructured":"J.-Y.\u00a0Girard, Y.\u00a0Lafont and P.\u00a0Taylor, Proofs and Types, Cambridge University Press, 1989."},{"key":"10.3233\/AIC-170740_ref18","unstructured":"IBM, IBM ILOG CPLEX Optimization Studio CP Optimizer User\u2019s Manual Version 12 Release 6, 2015."},{"key":"10.3233\/AIC-170740_ref19","unstructured":"C.\u00a0Jefferson and K.E.\u00a0Petrie, Provably pointless propagator calls, in: Fifth International Workshop on the Cross-Fertilization Between CSP and SAT, 2015, Co-located with CP 2015."},{"key":"10.3233\/AIC-170740_ref20","doi-asserted-by":"crossref","unstructured":"M.J.\u00a0Maher, Propagation completeness of reactive constraints, in: Proceedings ICLP 2002, 2002, pp.\u00a0148\u2013162.","DOI":"10.1007\/3-540-45619-8_11"},{"key":"10.3233\/AIC-170740_ref21","unstructured":"C.\u00a0Prud\u2019homme, J.-G.\u00a0Fages and X.\u00a0Lorca, Choco3 Documentation, TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S., 2014, http:\/\/www.choco-solver.org."},{"key":"10.3233\/AIC-170740_ref22","unstructured":"J.-C.\u00a0R\u00e9gin, A filtering algorithm for constraints of difference in CSPs, in: Proceedings 12th National Conference on Artificial Intelligence (AAAI 94), 1994, pp.\u00a0362\u2013367."},{"key":"10.3233\/AIC-170740_ref23","unstructured":"J.-C.\u00a0R\u00e9gin, Generalized arc consistency for global cardinality constraint, in: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 96), 1996, pp.\u00a0209\u2013215."},{"key":"10.3233\/AIC-170740_ref26","doi-asserted-by":"crossref","unstructured":"G.\u00a0Tack, C.\u00a0Schulte and G.\u00a0Smolka, Generating propagators for finite set constraints, in: Proc. 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 2006, pp.\u00a0575\u2013589.","DOI":"10.1007\/11889205_41"},{"key":"10.3233\/AIC-170740_ref27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","article-title":"Design, implementation, and evaluation of the constraint language cc(FD)","volume":"37","author":"Van Hentenryck","year":"1998","journal-title":"The Journal of Logic Programming"},{"key":"10.3233\/AIC-170740_ref28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","article-title":"Constraint satisfaction using constraint logic programming","volume":"58","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"}],"container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-170740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T18:27:42Z","timestamp":1777400862000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/AIC-170740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":26,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/aic-170740","relation":{},"ISSN":["1875-8452","0921-7126"],"issn-type":[{"value":"1875-8452","type":"electronic"},{"value":"0921-7126","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8,31]]}}}