Skip to main content
Log in

An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed constraint satisfaction problems (CSP). The algorithm is an adaptation of the well-known AC-4 algorithm to system settings where constraints can be added and deleted in concurrent processes. It is the first algorithm for arc-consistency enforcement in this system setting. Arc-consistency is achieved whenever the overall system reaches quiescence after a constraint is added or deleted.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bessière, C. (1991). Arc-consistency in Dynamic Constraint Satisfaction Problems. In Proceedings of the AAAI’91, 221–226

  • Coulouris, G., Dollimore, J. & Kindberg, T. (2001). Distributed Systems, 3rd edn . Addison-Wesley: Reading, MA

    Google Scholar 

  • Debruyne, R. (1996). Arc-Consistency in Dynamic CSPs is no More Prohibitive. In 8th conference on Tools in Artificial Intelligence (TAI96), 299–306

  • Dechter, R. (2003). Constraint Processing . Morgan Kaufmann: los Altos, CA

    Google Scholar 

  • et Y., Deville B. B. (1997). Analysis of Distributed Arc-Consistency Algorithms. Technical Report RR97-07, Universite Catholoque de Louvain

  • Hamadi, Y. (1999). Optimal Distributed Arc-Consistency. In Principles and Practice of Constraint Programming, 219–233

  • Lesaint D., Voudouris C., Azarmi N. (2000). Dynamic Workforce Scheduling for British Telecommunications plc. INFORMS 30(1): 45–56

    Google Scholar 

  • Mohr R., Henderson T. (1986). Arc and Path Consistency Revisited. Artificial Intelligence 28: 225–233

    Article  Google Scholar 

  • Monfroy, E. (2000). A Coordination-based Chaotic Iteration Algorithm for Constraint Propagation. In: Proceedings of the 15th ACM Symposium on Applied Computing, SAC’00, Track on Coordination Models, Languages and Applications

  • Nguyen T., Deville Y. (1998). A Distributed Arc-Consistency Algorithm. Science of Computer Programming 30(1–2): 227–250

    Article  MathSciNet  MATH  Google Scholar 

  • Ringwelski, G. (2002). Posting and Retracting Constraints in Asynchronous Solvers. In Second International Workshop on User-Interaction in Constraint Satisfaction (UICS 02). Ithaca

  • Ringwelski, G. (2004). Incremental Constraint Propagation for Interleaved Distributed Backtracking. In Proceedings of the 5th workshop on Distributed Constraint Reasoning. Toronto

  • Ringwelski, G., Wallace, R. (2004). Constraint Processing with Reactive Agents. In 17th International FLAIRS Conference AAAI Press

  • Ringwelski, G., Wolf, A. (2005). Global Production Planning in Multiple Facilities with the DISCS library. In Proceedings of the 19th Workshop on (Constraint) Logic Programming

  • Wallace, R. J. (1993). Why AC-3 is Almost Always Better Than AC-4 In Proceedings of the IJCAI-93, 239–245

  • Wolf A. (2001). Adaptive Constraint Handling with CHR in Java. In: Walsh T. (ed). Proceedings of the CP2001. Springer, Berlin, pp. 256–270

    Google Scholar 

  • Yokoo, M., Durfee, E. H. (1998). The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Transactions on Knowledge and Data Engineering 10 (5)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Georg Ringwelski.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ringwelski, G. An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems. Artif Intell Rev 24, 431–454 (2005). https://doi.org/10.1007/s10462-005-9003-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-005-9003-9

Keywords

Navigation