CLP(FD) Constraint Logic Programming over Finite Domains
Type Web
Created 2020-01-20
Available at pathwayslms.com/swipltuts/clpfd/clpfd.html#_domains
Identifier unavailable
Description
This tutorial is for reasonably experienced SWI-Prolog programmers who want to use clp(fd). Additionally, this tutorial will be useful for Prolog programmers using other versions of Prolog who want to use clp(fd). The emphasis of this tutorial is not on the theory. The author is not a mathematician and the tutorial will probably not be of much use to competent mathematicians who can approach the material via the academic literature. This tutorial should give you a grasp of the fundamentals of constraint systems on finite domains.
Relations
about Constraint logic programming
Constraint logic programming is a form of constraint programming, in which logic programming is exten...
Edit details Edit relations Attach new author Attach new topic Attach new resource
0.0 /10
useless alright awesome
from 0 reviews
- Resource level 0.0 /10
- beginner intermediate advanced
- Resource clarity 0.0 /10
- hardly clear sometimes unclear perfectly clear
- Reviewer's background 0.0 /10
- none basics intermediate advanced expert