Computer Science – Artificial Intelligence
Scientific paper
1998-10-20
Fundamenta Informaticae 34(1998), pp. 295-321
Computer Science
Artificial Intelligence
25 pages
Scientific paper
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 their use by analyzing the constraint propagation process for the {\tt SEND + MORE = MONEY} puzzle. We also show how this approach allows one to build new constraint solvers.
No associations
LandOfFree
A Proof Theoretic View of Constraint Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Proof Theoretic View of Constraint Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proof Theoretic View of Constraint Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-373248