A Proof Theoretic View of Constraint Programming

Simple item page
dc.creatorApt, Krzysztof R.
dc.date1998-10-20
dc.date.accessioned2026-07-07T03:23:45Z
dc.date.available2026-07-07T03:23:45Z
dc.descriptionWe 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.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/cs/9810018
dc.identifierhttp://arxiv.org/abs/cs/9810018
dc.identifierFundamenta Informaticae 34(1998), pp. 295-321
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33065
dc.subjectArtificial Intelligence
dc.subjectProgramming Languages
dc.subjectF.4.1;I.2.3;D.1.0
dc.titleA Proof Theoretic View of Constraint Programming
dc.typetext

Files

Collections

arXiv