Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2014: Principles and Practice of Constraint Programming pp 721–737Cite as

Global Constraints in Distributed CSP: Concurrent GAC and Explanations in ABT

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8656))

Abstract

The expressiveness of Distributed CSP has been recently enhanced to include global constraints. Careful reformulation of contractible global constraints has been shown to improve efficiency. In this paper, we first show that explained global constraints further improves the efficiency in distributed problems, sometimes by over two orders of magnitude. We then propose maintaining GAC concurrently for any global constraint, without reformulation. We show empirically that concurrent GAC significantly reduces both message passing and computation time, achieving an order of magnitude improvement on some distributed meeting scheduling problems.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Béjar, R., Domshlak, C., Fernández, C., Gomes, C., Krishnamachari, B., Selman, B., Valls, M.: Sensor networks and distributed csp: communication, computation and complexity. Artif. Intel. 161, 117–147 (2005)

    Article  MATH  Google Scholar 

  2. Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog. SICS Research Report (2005)

    Google Scholar 

  3. Bessiere, C., Brito, I., Gutierrez, P., Meseguer, P.: Global constraints in distributed constraint satisfaction and optimization. The Computer Journal (2013)

    Google Scholar 

  4. Bessière, C., Van Hentenryck, P.: To be or not to be... a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 789–794. Springer, Heidelberg (2003)

    Google Scholar 

  5. Bessiere, C., Maestre, A., Brito, I., Meseguer, P.: Asynchronous backtracking without adding links: a new member in the ABT family. Artif. Intel. 161, 7–24 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: Proceedings of ECAI 2004, pp. 146–150 (2004)

    Google Scholar 

  7. Brito, I., Meseguer, P.: Asynchronous backtracking for non-binary discsp. In: DCR Workshop at ECAI-2006, DCR 2006, Riva di Garda, Italia (2006)

    Google Scholar 

  8. Downing, N., Feydy, T., Stuckey, P.J.: Explaining alldifferent. In: Proceedings of ACSC 2012, Darlinghurst, Australia, Australia, pp. 115–124 (2012)

    Google Scholar 

  9. Downing, N., Feydy, T., Stuckey, P.J.: Explaining flow-based propagation. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 146–162. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Francis, K., Stuckey, P.: Explaining circuit propagation. Constraints 19(1), 1–29 (2014)

    Article  MathSciNet  Google Scholar 

  11. Gaudin, E., Jussien, N., Rochart, G.: Implementing explained global constraints. In: Proceedings of the CP 2004 Workshop on Constraint Propagation and Implementation (CPAI 2004), Toronto, Canada, Canada, pp. 61–76 (2004)

    Google Scholar 

  12. Gutierrez, P., Meseguer, P.: Saving redundant messages in bnb-adopt. In: AAAI 2010 (2010)

    Google Scholar 

  13. Jussien, N.: The versatility of using explanations within constraint programming. HDR, Université de Nantes (September 2003)

    Google Scholar 

  14. Jussien, N., Barichard, V.: The palm system: explanation-based constraint programming. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 118–133. Springer, Heidelberg (2000)

    Google Scholar 

  15. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Series (1997)

    Google Scholar 

  16. Maher, M.J.: Open contractible global constraints. In: Proceedings of IJCAI 2009, pp. 578–583. Morgan Kaufmann Publishers Inc., San Francisco (2009)

    Google Scholar 

  17. Mailler, R., Lesser, V.R.: Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems. JAIR 25(1), 529–576 (2006)

    MATH  MathSciNet  Google Scholar 

  18. Meisels, A., Lavee, O.: Using additional information in DisCSP search. In: Proceedings of DCR 2004 (2004)

    Google Scholar 

  19. Meisels, A., Zivan, R.: Asynchronous Forward-checking for DisCSPs. Constraints 12(1), 131–150 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  20. Petcu, A., Faltings, B.V.: A Value Ordering Heuristic for Distributed Resource Allocation. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 86–97. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Petcu, A., Faltings, B.: DPOP: A Scalable Method for Multiagent Constraint Optimization. In: Proceedings of IJCAI 2005, pp. 266–271 (2005)

    Google Scholar 

  22. Régin, J.C.: A filtering algorithm for constraints of difference in csps. In: Proceedings of AAAI 1994, pp. 362–367 (1994)

    Google Scholar 

  23. Régin, J.C.: Global constraints: A survey. In: van Hentenryck, P., Milano, M. (eds.) Hybrid Optimization, pp. 63–134. Springer, New York (2011)

    Chapter  Google Scholar 

  24. Rochart, G.: Explanations for global constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 993–993. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Rochart, G.: Explications et programmation par contraintes avancée. Ph.D. thesis, Nantes University, France (2005)

    Google Scholar 

  26. Roussel, O., Lecoutre, C.: Xml representation of constraint networks: Format xcsp 2.1. CoRR (2009)

    Google Scholar 

  27. Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints 16(3), 250–282 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  28. Silaghi, M.C.: Generalized Dynamic Ordering for Asynchronous Backtracking on DisCSPs. In: Proceedings of DCR 2006 (2006)

    Google Scholar 

  29. Silaghi, M.C., Faltings, B.: Asynchronous aggregation and consistency in distributed constraint satisfaction. Artif. Intel. 161, 25–53 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  30. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous Search With Aggregations. In: Proceedings of AAAI 2000/IAAI 2000, pp. 917–922 (2000)

    Google Scholar 

  31. Wahbi, M.: Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. John Wiley & Sons, Inc. (2013)

    Google Scholar 

  32. Wahbi, M., Ezzahir, R., Bessiere, C.: Asynchronous Forward Bounding Revisited. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 708–723. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  33. Wahbi, M., Ezzahir, R., Bessiere, C., Bouyakhf, E.H.: DisChoco 2: A Platform for Distributed Constraint Reasoning. In: Proceedings of workshop on DCR 2011, pp. 112–121 (2011), http://dischoco.sourceforge.net/

  34. Wahbi, M., Ezzahir, R., Bessiere, C., Bouyakhf, E.H.: Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search. In: Proceedings of ICTAI 2012, Athens, Greece, pp. 33–40 (November 2012)

    Google Scholar 

  35. Wahbi, M., Ezzahir, R., Bessiere, C., Bouyakhf, E.H.: Nogood-Based Asynchronous Forward-Checking Algorithms. Constraints 18(3), 404–433 (2013)

    Article  MathSciNet  Google Scholar 

  36. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proceedings of 12th IEEE Int’l Conf. Distributed Computing Systems, pp. 614–621 (1992)

    Google Scholar 

  37. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. on Knowledge and Data Engineering 10, 673–685 (1998)

    Article  Google Scholar 

  38. Zivan, R., Meisels, A.: Message delay and DisCSP search algorithms. Annals of Mathematics and Artificial Intelligence 46(4), 415–439 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  39. Zivan, R., Zazone, M., Meisels, A.: Min-Domain Retroactive Ordering for Asynchronous Backtracking. Constraints 14(2), 177–198 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Ireland

    Mohamed Wahbi & Kenneth N. Brown

Authors
  1. Mohamed Wahbi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth N. Brown
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Western Road, Cork, Ireland

    Barry O’Sullivan

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Wahbi, M., Brown, K.N. (2014). Global Constraints in Distributed CSP: Concurrent GAC and Explanations in ABT. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10428-7_52

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10427-0

  • Online ISBN: 978-3-319-10428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation