Logic Programming using Prolog

Group A

The exercises of this group are implemented using the standard ECLiPSe-CLP Prolog predicates.

1. RunLengthEncoding: Encode and decode a sequence of symbols.
2. Registers: Move and Swap content between registers.

Group B

The exercises of this group are all CSP-based problems, and are solved using the ic, ic_global and branch_and_bound libraries provided by ECLiPSe-CLP.

1. Max Clique Problem: Find a clique with the largest possible number of vertices.
2. Liars: Find out who is liar.
3. Car Sequence: Place the cars in the right order.
4. Tents: Place a tent next to a tree, in a NxM matrix.

All exercises are implemented in ECLiPSe-CLP Prolog.