In this class, we are going to practice constraint logic programming with finite domain (clp(FD)), implementing some known programs (for example, n-queens and factorial), and some new ones. Please, have a look here in order to learn more about clp(FD) in Prolog. This web page has the examples already implemented, but you should try by yourself before looking at those implementations.
For this class you should implement clp(FD) solutions to the following problems: factorial, send+more=money, nqueens.
Refer to the manual for predicates like label/1, labeling/2, before/2, etc: clp(FD) documentation.
In order to use the library you should add
:- use_module(library(clpfd)).to your code.
Do not forget that these libraries (clp(X)) use a different syntax to arithmetic operators.