A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs

摘要

We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.