Christophe Aillaud

Learn More
This paper presents the principles of a Constraint Logic Program debug-ging module, currently implemented in the DiSCiPl project 3, which concerns performance debuggging and helps to understand program behaviour in particular in complex combinatorial problems. It is based on search-tree abstractions. It deenes the notion of abstract search-tree and a method(More)
  • 1