Skip to content

GitLab

Last edited by Mateusz Ślażyński
Page history
This is an old version of this page. You can view the most recent version or browse the history.

Theory

Typed Constraint Graph

In the heart of the NDL language lies a specific representation of Constraint Programming Problems. Instead of using a common Constraint (Hyper-) Graph formalization, we introduce a Typed Constraint Graph, that enriches the Constraint Graphs with types, representing the higher level structure of the problem.