In this thesis, we study several algorithms for enforcing Generalized Arc-Consistency (GAC), which is the most popular consistency property for solving Constraint Satis-faction Problems (CSPs) with backtrack search. The popularity of such algorithms stems from their relative low cost

time complexity of O(e d2) where e is the number of constraints and d is the maximum domain size ofthe variables. On the other side there are lightweight arc consistency algorithms such as AC-3 [8], AC-3d [13], and AC-3p [15] which do not use additional data structures.These algorithms repeat

and describe a generalized arc consistency algorithm with low cost that can ensure polynomial query evaluation. Finally, we demonstrate that maintaining the consistency of such non-binary constraints can greatly accelerate search in intractable queries that include referential relationships. 1

This work presents the parallelisation of the AC-5 arc-consistency algorithm for a centralised memory machine (Enterprise). We conducted our experiments using an adapted version of the PCSOS parallel constraint solving system, over finite domains. In the implementation for a centralised memory

Arc-consistency algorithms prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks to find out about the properties of CSPs. Their arc-heuristics select the constraint and their domain-heuristics select the values for the next support-check. We shall combine AC-3

Exploiting residual supports (or residues) has proved to be one of the most cost-effective approaches for Maintaining Arc Consistency during search (MAC). While MAC based on optimal AC algorithm may have better theoretical time complexity in some cases, in practice the overhead for maintaining

of stronger local consistency forms (like path con-sistency) is still limited since they need complicated data structures to be managed and the constraint graph may be modied. In this paper, we propose a possible way to get benets from using, in a preprocessing step, a partial form of path consistency and arc

Abstract: Palaeomagnetic and structural investigations in the Rif arc of Morocco indicate that there have been large rotations associated with a pattern of outwardly directed thrusting. Rock magnetic experiments inconjunction with thermal and alternating field demagnetization demonstrate that eight

anomalies beneath the backarc basin, indicating that a broad zone of magma production feeds the backarc spreading center. The magnitude of the velocity anomaly is consistent with the presence of approximately 1% partial melt at depths of 30-90 km. The best-imaged arc-backarc system, the Tonga-Lau region

Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that enforces a higher order of consistency than arc consistency. Despite the strong pruning that can be achieved, maxRPC is rarely used because existing maxRPC algorithms suffer from overheads and redundancies