We present a general approach for solving Constraint Optimization Problems. In this order, we design a Consistent Neighbourhood which, after each variable assignment, deletes conflicting variables to maintain the constraint consistency. Hence, instead of allowing infeasible moves on complete configurations, we work only on partial consistent ones until a solution is found. This approach is successfully applied in solving four real-life problems.