Abstract
One strand of CP research seeks to design a small set of primitives and operators that can be used to build an appropriate algorithm for solving any given combinatorial problem. The aim is to "package" CP, simplifying its use, in contrast to current systems which offer application developers a full constraint programming language. In this talk we examine the risks of this line of research, and argue that our field is still too immature to be ready for "packaging". © Springer-Verlag 2003.
Cite
CITATION STYLE
Wallace, M. (2003). Languages versus packages for constraint problem solving. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 37–52. https://doi.org/10.1007/978-3-540-45193-8_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
