Abstract
This article deals with the configuration task. Configuring means assembling a set of predefined components in order to build a composite object that meets a set of requirements.
Here we present 𝒞𝒪𝒞𝒪𝒩ℱ, an approach to configuration based on a conceptual encoding of the configuration knowledge, directly exploitable by a software configuration system to compute configurations.
In particular, we show how Conflict-Directed Backjumping can be adapted to the proposed framework and in which way the efficiency of the configurator may be still enhanced by two look-ahead mechanisms, which exploit the characteristics of the modeling language and the explicit representation of both the compositional structure and the taxonomic relations among component types.
The configuration algorithms are explained in detail; the assumptions and the properties which they are based on are explicitly stated. Formal proofs are provided for the basic properties.
A set of experimental results on three different real-world domains are presented, which prove the suitability of the approach.