Solution is by branching on propositional variables.
Both a linear solver and a logical inference algorithm are used at each node of the search tree. Most generic disjunctive programming techniques do not exploit the relationships between the disjunctive constraints of a given problem. In contrast, more specific techniques globally exploit cliques of disjunctions to better organize and reduce search. When modeling capabilities are added to a constraint programming language, DLP does not need 0-1 variables to encode logic. In the latter case, direct contact can be made with general temporal constraint network models, which enables effective and broadly applicable scheduling procedures.