Computability of Modularization of Constraints

Summary We classify the computability of modularizing constraints by their syntactic properties. We show that for linear constraints, composing modularly defined predicates contributes to the computability of modularization and the possibility of termination of the Modularization Algorithm, while for non-linear constraints, it does not.