A Proof Theoretic View of Constraint Programming

Authors:
Krzysztof R. Apt
Affiliations:
(Correspd.) CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Dept. of Mathematics, Computer Science, Physics & Astronomy, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amst ...
Venue:
Fundamenta Informaticae
Year:
1998

Citing 16
Cited 2

Constraint propagation with interval labels

Artificial Intelligence
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Constraint satisfaction using constraint logic programming

Artificial Intelligence - Special volume on constraint-based reasoning
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Foundational issues in implementing constraint logic programming systems

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Strategic directions in constraint programming

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Combinatorial optimization

Combinatorial optimization
Algorithm = logic + control

Communications of the ACM
Value Constraints in the CLP Scheme

Constraints
Constraint Logic Programming in the Sequent Calculus

LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
From Chaotic Iteration to Constraint Propagation

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Constraint Handling Rules

Selected Papers from Constraint Programming: Basics and Trends
Consistency techniques for numeric CSPs

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Truth maintenance

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Executing Suspended Logic Programs

Fundamenta Informaticae
Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies

Fundamenta Informaticae

Some Remarks on Boolean Constraint Propagation

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.