CLPGUI is a graphical user interface for visualizing and interacting with constraint logic programs over nite domains. In CLPGUI, the user can control the execution of a CLP program through several views of constraints, of nite domain variables and of the search tree. CLPGUI is intended

FaCiLe is an open source constraint programming library over integer nite domain written in OCaml, a functional language of the ML family. It oers all usual constraint system facilities to create and handle nite domain variables, arithmetic constraints (possibly nonlinear) , built-in global constraints and search goals. FaCiLe allows as well to build easily user-dened constraints and goals from scratch or by combining simple primitives, making pervasive use of higher-order functionals to provide a simple and exible user interface. As FaCiLe is an OCaml library and not yet another language, the user benets from polymorphic type inference and strong typing discipline, high level of abstraction, generic modules and object system, as well as native code compilation eciency, garbage collection and replay debugger. All these features allow to prototype and experiment quickly: modelling, data processing and interface are implemented in the same powerful language with a high level of safety.

The availability of commodity multi-core and multi-processor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. They also present a fundamental challenge: how to exploit parallelism transparently to speed up constraint programs. This paper shows how to parallelize constraint programs transparently without changes to the code. The main technical idea consists of automatically lifting a sequential exploration strategy into its parallel counterpart, allowing workers to share and steal subproblems. Experimental results show that the parallel implementation may produces significant speedups on multi-core machines. 1

Recent developments in constraint programming systems show an increasing emphasis on providing abstractions for con guring search. Existing frameworks for tree search oer customized exploration, branching and state restoration policies. We argue, however, that most of these frameworks do not provide adequate abstractions for more complex search scenarios, where dierent search techniques are used in different phases of the search, where parts of search trees are systematically discarded, or where tree search is embedded in a context of local optimization. In this paper, we propose to describe complex search scenarios using a compositional framework, realized in the Figaro library, with an abstraction called engine. We demonstrate its expressivity by re-formulating two complex search scenarios from the literature.

CLPGUI is a graphical user interface for visualizing and interacting with constraint logic programs over finite domains. In CLPGUI, the user can control the execution of a CLP program through several views of constraints, of finite domain variables and of the search tree. CLPGUI is intended to be used both for teaching purposes...