Explaining Constraint Programming

We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we identify three levels of abstraction. Each level sheds light on the essence of CP. In particular, the highest level allows us to bring CP closer to the computation as deduction paradigm. At the middle...

Full description

Saved in:
Bibliographic Details
Published inProcesses, Terms and Cycles: Steps on the Road to Infinity pp. 55 - 69
Main Author Apt, Krzysztof R.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
SeriesLecture Notes in Computer Science
Subjects
Constraint Programming
Constraint Propagation
Constraint Satisfaction Problem
Logic Program
Proof Rule
Online AccessGet full text
ISBN354030911X
9783540309116
ISSN0302-9743
1611-3349
DOI10.1007/11601548_6

Cover

More Information
Summary:We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we identify three levels of abstraction. Each level sheds light on the essence of CP. In particular, the highest level allows us to bring CP closer to the computation as deduction paradigm. At the middle level we can explain various constraint propagation algorithms. Finally, at the lowest level we can address the issue of automatic generation and optimization of the constraint propagation algorithms.
ISBN:354030911X
9783540309116
ISSN:0302-9743
1611-3349
DOI:10.1007/11601548_6