Algorithms for Solving Distributed Constraint Satisfaction Problems (DCSPs). Conference Paper uri icon


  • Abstract This paper investigates Constraint Satisfaction Problems (CSPs) that axe distributed by nature, ie, there is a division of the CSP into sub components (agents) that axe connected via constraints, where each subcomponent includes several of the CSP variables with the constraints between them. We call such a problem a Distributed CSP (DCSP). In this paper we give a formal definition of DCSPs and present four algorithms for solving them. Two of the algorithms are based on the difference between the difficulty of solving the …

publication date

  • May 29, 1996

presented at event