CLP（Constraint Logic Programming）は、Prologの論理プログラミングに 制約解決器（Constraint Solver） を統合したものです。 特にCLP (FD)は 有限領域制約（Finite Domains） を扱うもので、変数が取りうる値の範囲が有限である場合に強力な推論能力を発揮します。

This repository contains the lab exercises from the Constraint Logic Programming course at the University of Macedonia. The exercises were implemented using Prolog and cover various topics related to ...

Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...