.png){kind=icon}
Return
An arc-consistency algorithm for dynamic and distributed constraint satisfaction problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-005-9003-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
constraint propagation
dynamic and distributed constraint processing
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveMacrosomia is associated with high weight-for-height in children aged 1–3 years in Shanghai, China
PREAI
ShareSaveShareSaveShareSaveDiverticular disease increases and effects younger ages: an epidemiological study of 10-year trends
PREAI
ShareSave no more
no more