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

Authors:
Gérard Ferrand;Arnaud Lallouet
Affiliations:
-;-
Venue:
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Year:
2002

Citing 3
Cited 0

Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.