|
|
|
$`X = 5 + 1`$ |
|
|
\ No newline at end of file |
|
|
|
# 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. |
|
|
\ No newline at end of file |
