A New Variable-Oriented Propagation Scheme for Constraint Satisfaction Problem

  • Zhe Li
  • Mingqi Yang
  • Zhanshan LiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11062)


The coarse-grained arc consistency algorithms maintain a list of elements that need to be revised. It is well known that the performance of such algorithms is affected by the way in which the revisions are performed. In this paper, we propose a new variable-oriented propagation scheme that splits the propagation procedure into two independent phases. We show how it reduces the number of revisions and list operations. In experiments, we apply different revision ordering heuristics to this new variable-oriented scheme and compare them with the most efficient existing propagation schemes. The results from various structured and random problems show that the proposed propagation scheme reduces the number of revisions and offers speed-ups.


Constraint satisfaction problem Arc consistency Propagation scheme 


  1. 1.
    Balafoutis, T., Stergiou, K.: Exploiting constraint weights for revision ordering in arc consistency algorithms. In: ECAI 2008 Workshop on Modeling and Solving Problems with Constraints (2008)Google Scholar
  2. 2.
    Bessière, C., Régin, J.-C.: Refining the basic constraint propagation algorithm. In: IJCAI, vol. 1, pp. 309–315 (2001)Google Scholar
  3. 3.
    Boussemart, F., Hemery, F., Lecoutre, C.: Revision ordering heuristics for the constraint satisfaction problem. In: Proceedings of CPAI, vol. 4, pp. 29–43 (2004)Google Scholar
  4. 4.
    Gent, I.P., MacIntyre, E., Prosser, P., Shaw, P., Walsh, T.: The constrainedness of arc consistency. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 327–340. Springer, Heidelberg (1997). Scholar
  5. 5.
    Lecoutre, C.: Constraint Networks: Targeting Simplicity for Techniques and Algorithms, p. 193. Wiley, Hoboken (2013)Google Scholar
  6. 6.
    Lecoutre, C.: XCSP2 web page (2017).
  7. 7.
    Lecoutre, C., Boussemart, F., Hemery, F.: Exploiting multidirectionality in coarse-grained arc consistency algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 480–494. Springer, Heidelberg (2003). Scholar
  8. 8.
    Lecoutre, C., Hemery, F., et al.: A study of residual supports in arc consistency. In: IJCAI, vol. 7, pp. 125–130 (2007)Google Scholar
  9. 9.
    Lecoutre, C., Vion, J.: Enforcing arc consistency using bitwise operations. Constraint Program. Lett. (CPL) 2, 21–35 (2008)Google Scholar
  10. 10.
    Mackworth, A.K.: Consistency in networks of relations. Read. Artif. Intell. 8(1), 99–118 (1981)CrossRefGoogle Scholar
  11. 11.
    Mcgregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229–250 (1979)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Rossi, F., Beek, P.V., Walsh, T.: Handbook of Constraint Programming, p. 19. Elsevier, New York City (2006)zbMATHGoogle Scholar
  13. 13.
    van Dongen, M.R.C.: AC-3\({}_{\rm d}\) an efficient arc-consistency algorithm with a low space-complexity. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 755–760. Springer, Heidelberg (2002). Scholar
  14. 14.
    van Dongen, M.R.C.: Beyond singleton arc consistency. In: ECAI 2006, European Conference on Artificial Intelligence. Including Prestigious Applications of Intelligent Systems, 29 August–1 September 2006, Riva Del Garda, Italy, pp. 163–167 (2006)Google Scholar
  15. 15.
    Wallace, R.J., Freuder, E.C.: Ordering heuristics for arc consistency algorithms. In: Proceedings of the Biennial Conference-Canadian Society for Computational Studies of Intelligence, p. 163. Canadian Information Processing Society (1992)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry, College of Computer Science and TechnologyJilin UniversityChangchunChina

Personalised recommendations