Lecture Notes in Computer Science, 2002, Volume 2401/2002, 200-217, DOI: 10.1007/3-540-45619-8_41

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

Gérard Ferrand and Arnaud Lallouet

View Related Documents

Abstract

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

Fulltext Preview

Image of the first page of the fulltext document