Debugging constraint programs [chapter]

Micha Meier
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
more » ... t too slow to be feasible. The whole area of CP debugging is still lacking both methodology and tools to support users in improving their programs. In this paper, we present a paradigm for tracing constraint programs and the design and implementation of Grace, a graphical environment for tracing CLP(FD) programs on top of ECL i PS e . III
doi:10.1007/3-540-60299-2_13 fatcat:z44jz6kfn5aqhd6drblrwjvroy