Skip to content

Research at St Andrews

Generalized support and formal development of constraint propagators

Research output: Research - peer-reviewArticle


Open Access permissions



Constraint programming is a family of techniques for solving combinatorial problems, where the problem is modelled as a set of decision variables (typically with finite domains) and a set of constraints that express relations among the decision variables. One key concept in constraint programming is propagation: reasoning on a constraint or set of constraints to derive new facts, typically to remove values from the domains of decision variables. Specialized propagation algorithms (propagators) exist for many classes of constraints.

The concept of support is pervasive in the design of propagators. Traditionally, when a domain value ceases to have support, it may be removed because it takes part in no solutions. Arc-consistency algorithms such as AC2001 make use of support in the form of a single domain value. GAC algorithms such as GAC-Schema use a tuple of values to support each literal. We generalize these notions of support in two ways. First, we allow a set of tuples to act as support. Second, the supported object is generalized from a set of literals (GAC-Schema) to an entire constraint or any part of it.

We design a methodology for developing correct propagators using generalized support. A constraint is expressed as a family of support properties, which may be proven correct against the formal semantics of the constraint. We show how to derive correct propagators from the constructive proofs of the support properties. The framework is carefully designed to allow efficient algorithms to be produced. Derived algorithms may make use of dynamic literal triggers or watched literals for efficiency. Finally, three case studies of deriving efficient algorithms are given.


Original languageEnglish
Pages (from-to)325-346
JournalAI Communications
Issue number5
StatePublished - 31 Aug 2017

    Research areas

  • Constraint satisfaction problem, Constraint programming, Formal methods

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Automatically improving constraint models in Savile Row

    Nightingale, P., Akgün, Ö., Gent, I. P., Jefferson, C., Miguel, I. & Spracklen, P. Oct 2017 In : Artificial Intelligence. 251, p. 35-61 27 p.

    Research output: Research - peer-reviewArticle

  2. Complexity of n-Queens Completion

    Gent, I. P., Jefferson, C. A. & Nightingale, P. W. Aug 2017 In : Journal of Artificial Intelligence Research. 59, p. 815-848 34 p.

    Research output: Research - peer-reviewArticle

  3. Exploiting short supports for improved encoding of arbitrary constraints into SAT

    Akgün, Ö., Gent, I. P., Jefferson, C. A., Miguel, I. J. & Nightingale, P. W. 2016 Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. Rueher, M. (ed.). Springer, p. 3-12 (Lecture Notes in Computer Science; vol. 9892)

    Research output: ResearchConference contribution

  4. S-crucial and bicrucial permutations with respect to squares

    Gent, I., Kitaev, S., Konovalov, A., Linton, S. & Nightingale, P. 3 Jun 2015 In : Journal of Integer Sequences. 18, 6, 22 p., 15.6.5

    Research output: Research - peer-reviewArticle

  5. Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination

    Nightingale, P., Akgun, O., Gent, I. P., Jefferson, C. & Miguel, I. Sep 2014 Principles and Practice of Constraint Programming. OSullivan, B. (ed.). Cham: Springer, p. 590-605 16 p. (Lecture Notes in Computer Science; vol. 8656)

    Research output: ResearchConference contribution

Related by journal

  1. An Empirical Study of Learning and Forgetting Constraints

    Gent, I. P., Miguel, I. J. & Moore, N. C. A. 2012 In : AI Communications. 25, 2, p. 191-208 17 p.

    Research output: Research - peer-reviewArticle

  2. An Evaluation of Machine Learning in Algorithm Selection for Search Problems

    Kotthoff, L., Gent, I. P. & Miguel, I. J. 2012 In : AI Communications. 25, 3, p. 257-270 14 p.

    Research output: Research - peer-reviewArticle

  3. Search in the Patience Game `Black Hole'

    Gent, I. P., Kelsey, T. W., Jefferson, C., Lynce, I., Miguel, I. J., Nightingale, P., Smith, B. M. & Armagan Tarim, S. 2007 In : AI Communications. 20, 3, p. 211-226 16 p.

    Research output: Research - peer-reviewArticle

ID: 250936574