A Proof Theoretic View of Constraint Programming
Krzysztof Rafal Apt · Fundamenta Informaticae · 1998
We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and illustrate t