A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
From Chaotic Iteration to Constraint Propagation
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications. CSPs can be solved with complete methods or incomplete methods. Although some frameworks has been designed to formalized constraint propagation, there are only few studies of theoretical frameworks for local search. In this paper, we are concerned with the design of a generic framework to model local search as the computation of a fixed point of functions and to solve the Sudoku problem. This work allows one to simulate standard strategies used for local search, and to design easily new strategies in a uniform framework.