Skip to main content

A New Variable-Oriented Propagation Scheme for Constraint Satisfaction Problem

  • Conference paper
  • First Online:
Knowledge Science, Engineering and Management (KSEM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11062))

  • 1372 Accesses

Abstract

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.

This work was supported by the China NSFC (61672261) and the Science-Technology Development Project from Jilin Province of China (20180101043JC).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. Bessière, C., Régin, J.-C.: Refining the basic constraint propagation algorithm. In: IJCAI, vol. 1, pp. 309–315 (2001)

    Google Scholar 

  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. 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). https://doi.org/10.1007/BFb0017449

    Chapter  Google Scholar 

  5. Lecoutre, C.: Constraint Networks: Targeting Simplicity for Techniques and Algorithms, p. 193. Wiley, Hoboken (2013)

    Google Scholar 

  6. Lecoutre, C.: XCSP2 web page (2017). http://www.cril.univ-artois.fr/~lecoutre/index.html

  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). https://doi.org/10.1007/978-3-540-45193-8_33

    Chapter  Google Scholar 

  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. Lecoutre, C., Vion, J.: Enforcing arc consistency using bitwise operations. Constraint Program. Lett. (CPL) 2, 21–35 (2008)

    Google Scholar 

  10. Mackworth, A.K.: Consistency in networks of relations. Read. Artif. Intell. 8(1), 99–118 (1981)

    Article  Google Scholar 

  11. Mcgregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229–250 (1979)

    Article  MathSciNet  Google Scholar 

  12. Rossi, F., Beek, P.V., Walsh, T.: Handbook of Constraint Programming, p. 19. Elsevier, New York City (2006)

    MATH  Google Scholar 

  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). https://doi.org/10.1007/3-540-46135-3_58

    Chapter  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhanshan Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, Z., Yang, M., Li, Z. (2018). A New Variable-Oriented Propagation Scheme for Constraint Satisfaction Problem. In: Liu, W., Giunchiglia, F., Yang, B. (eds) Knowledge Science, Engineering and Management. KSEM 2018. Lecture Notes in Computer Science(), vol 11062. Springer, Cham. https://doi.org/10.1007/978-3-319-99247-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99247-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99246-4

  • Online ISBN: 978-3-319-99247-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics