IOS Press A Proof Theoretic View of Constraint Programming
Download:
|
|
by Krzysztof R. Apt
http://www.cwi.nl/~apt/fi98.ps
Add To MetaCart
Abstract:
Abstract. 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 SEND + MORE = MONEY puzzle. We also show how this approach allows one to build new constraint solvers.
Citations
| 135 | Combinatorial Optimization – Cook, Cunningham, et al. - 1998 |
| 19 | Introduction to the CLAIRE Programming Language – Caseau, Laburthe - 1996 |
| 18 | From Chaotic Iteration to Constraint Propagation – Apt - 1997 |
| 17 | A functional view of rewriting and strategies for a semantics of ELAN – Borovansk'y, Kirchner, et al. - 1998 |
| 16 | Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies – Castro - 1998 |
| 4 | Narrowing a 2n-block of sortings in O(nlog(n – Guernalec, Colmerauer - 1997 |
| 4 | Constraint logic programming in the sequent calculus – Darlington, Guo - 1994 |
| 2 | Foundational issues in implementing constraint logic programming systems – Andrews - 1995 |
