Solving FD Constraints in T OY(FD)

Abstract. This paper highlights the power of T OY(FD), a functional logic language with support for finite domain constraints, and shows, by means of examples, how combinatorial and optimization problems are easily coded and solved in T OY(FD). Moreover, a comparison with respect to the traditional CLP(FD) approach demonstrates that T OY(FD) is not only an alternative but is more flexible and provides higher expressivity. The paper also introduces a novel proposal in functional logic languages to recover and manage, at the user level, internal information about the constraint solving processing at runtime. This proposal increases the constraint capacity of the language as it allows the user to implement specific constraint mechanisms (e.g., new search strategies)