A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Debugging constraint programs
[chapter]
1995
Lecture Notes in Computer Science
Constraint programming (CP) is in its substance non-algorithmic programming, not last because it is often being applied to problems for which no efficient algorithms exist. A not immediately obvious consequence of this fact is that debugging CP programs is principally different from debugging algorithmic programs, including imperative, functional or Prolog programs. It is also more difficult. Moreover, it is frequently necessary to apply performance debugging to CP programs, which are correct
doi:10.1007/3-540-60299-2_13
fatcat:z44jz6kfn5aqhd6drblrwjvroy