Shaving algorithms, like singleton arc consistency (sac), are currently receiving much interest. They remove values which are not part of any solution. This paper proposes an efficient shaving algorithm for enforcing stronger forms of consistency than sac. The algorithm is based on the notion of weak k-singleton arc consistency, which is equal to sac if
Marc R. C. van Dongen