Consistency of compatibility constraints in configuration management

Abstract

The notion of compatibility constraints in a configuration management system is introduced. These constraints form a user-defined rule base; in such a context an efficient consistency verification is required. It is proved that checking the consistency of a set of compatibility constraints is an NP-complete problem. The restrictions needed to make the problem tractable are investigated. A linear algorithm is given for an important restricted case.<>