| | |
Summary: Problem Decomposition in Configuration
Diego Magro, Pietro Torasso and Luca Anselma
Abstract.
In the present work the issue of decomposinga configuration prob-
lem is approached in a framework where the domain knowledge is
represented in a structured way by using a KL-One like language
and whole-part relations play a major role in defining the structure
of the configurable objects. The representation formalism provides
also a constraint language for expressing complex relations among
components and subcomponents.
The paper presents a notion of boundness among constraints
which assures that two components not involved in a same set of
bound constraints can be independently configured. The computa-
tion of boundnessamong constraints is the basis for partitioning con-
straints associatedwith each componentto be configured. Such a par-
titioning induces a decomposition of the configuration problem into
independent subproblems.
Both a recursive and a non recursive decomposition strategies are
presented and the savings in computational time and reduction in
|
