Local consistency is a condition used in constraint satisfaction problems (CSPs) to simplify problems by ensuring that small subsets of variables comply with their constraints without considering the entire network. It helps in reducing the search space and making CSPs more efficient by iteratively applying local consistency checks to prune incompatible variable assignments.