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

Authors:
Georg Ringwelski
Affiliations:
Cork Constraint Computation Center, University College Cork, Cork, Ireland
Venue:
Artificial Intelligence Review
Year:
2005

Citing 10
Cited 0

Arc and path consistence revisited

Artificial Intelligence
A distributed arc-consistency algorithm

Science of Computer Programming - Special issue on concurrent constraint programming
A coordination-based chaotic iteration algorithm for constraint propagation

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Distributed systems (3rd ed.): concepts and design

Distributed systems (3rd ed.): concepts and design
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Optimal Distributed Arc-Consistency

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Adaptive Constraint Handling with CHR in Java

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Dynamic Workforce Scheduling for British Telecommunications plc

Interfaces
Arc-Consistency in Dynamic CSPs Is No More Prohibitive

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Constraint Processing

Constraint Processing

Quantified Score

Hi-index	0.00

Visualization

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.