About this paper

An algebraic study of adding implied constraints and finding compact equivalent descriptions of CSP instances.

A densification operator generates every constraint satisfied by all solutions. Implicational systems connect this closure operation to sparsification, and the Boolean case is characterized using bounded-width constraint languages.