A Constraint Functional Logic Language for Solving Combinatorial Problems

Abstract

We present CFLP(FD), a constraint functional logic programming approach over finite domains (FD) for solving typical combinatorial problems. Our approach adds to former approaches as Constraint Logic Programming (CLP), and Functional Logic Programming (FLP) both expressiveness and further efficiency by combining combinatorial search with propagation. We integrate FD constraints into the functional logic language TOY. CFLP(FD) programs consist of TOY rules with FD constraints declared as functions. CFLP(FD) seamlessly combines the power of CLP over FD with the higher order characteristics of FLP.