Each task v has a domain F(v) (local feasible values) and an optional chosen value.
Binary compatibility constraints live on edges and decide which pairs of values are allowed. The solver finds a value choice for every node satisfying all edge constraints. The interface calls this completion a global section by analogy; no common edge stalks or restriction maps are supplied.
Tip: leaving some nodes as ? asks the solver to find any completion (a global section extending your partial assignment).