Languages versus packages for constraint problem solving

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)

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”.
Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming – CP 2003
Subtitle of host publication9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings
EditorsFrancesca Rossi
Place of PublicationBerlin Germany
PublisherSpringer
Pages37-52
Number of pages16
ISBN (Print)3540202021
DOIs
Publication statusPublished - 2003
Externally publishedYes
EventInternational Conference on Principles and Practice of Constraint Programming 2003 - Kinsale, Ireland
Duration: 29 Sep 20033 Oct 2003
Conference number: 9th
https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13743 (Proceedings)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume2833
ISSN (Print)0302-9743

Conference

ConferenceInternational Conference on Principles and Practice of Constraint Programming 2003
Abbreviated titleCP 2003
CountryIreland
CityKinsale
Period29/09/033/10/03
Internet address

Cite this