Solving hypertree structured CSP: Sequential and parallel approaches

Solving CSP is in general NP-Complete. However, there are vari-ous subsets of CSPs that can be solved in polynomial time. Some of them can be identified by analyzing their structure. Unfortunately the proposed methods for exploiting these structural proprieties are not ef-ficient in practice. So exploiting these structural properties for solving CSP ∫ is a crucial challenge. In this paper, we propose efficient algo-rithms which exploit these structural proprieties, for both sequential and parallel resolutions. Some experiments done on academic bench-marks show the efficiciency of our approach.