Formalization and automatic interpretation of map requirements

The map requirements (constraints) can be interpreted by computer programs using their basic embedded functionalities. There are a huge number of constraints available to define the objective of various generalization outputs. Some of the constraints contain high-level knowledge which is not easy to interpret. This needs a huge amount of efforts to implement those constraints. The fact that many constraints have something in common makes the implementation per constraint a waste of resource. The paper proposes to decompose the constraints into more basic units, so as to interpret those constraints more flexible and reuse the already developed functionality as much as possible.