Midwinters, end games, and body parts: a classification of part-whole relations
International Journal of Human-Computer Studies - Special issue: the role of formal ontology in the information technology
Partitioning methods for satisfiability testing on large formulas
Information and Computation
A comparison of structural CSP decomposition methods
Artificial Intelligence
Configuring Large Systems Using Generative Constraint Satisfaction
IEEE Intelligent Systems
An Industrial Strength Description Logics-Based Configurator Platform
IEEE Intelligent Systems
A Generative Constraint Formalism for Configuration Problems
AI*IA '93 Proceedings of the Third Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
The description logic handbook
Towards a general ontology of configuration
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
A classification and constraint-based framework for configuration
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Closed terminologies in description logics
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A method of rule match conflict resolution for product configuration in manufacturing
International Journal of Computer Integrated Manufacturing
A Fuzzy Approach to Product Configuration on Standard Databases
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
𝒞𝒪𝒞𝒪𝒩ℱ: Conceptual language-based configuration
AI Communications
The Knowledge Engineering Review
Designing a tool for configuring an intelligent and flexible web-based system
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
The paper introduces and discusses the notion of decomposition of a configuration problem within the framework of a structured logical approach. The paper describes under which conditions a given configuration problem can be decomposed into a set of noninteracting subproblems and how to exploit such a decomposition, both for improving the performance of the configurator and for supporting interactive configuration. Different kinds of decomposition are considered, but all of them exploit, as much as possible, the explicit representation of the partonomic relations in the FPC language, a KL-One like representation formalism augmented with constraints for expressing complex interrole relations. The paper introduces a notion of boundness among constraints, which is used for formally specifying different types of decomposition. One decomposition strategy aims at singling out the components and subcomponents that are directly related to the constraints put by the user's requirements; the configurator exploits such decomposition by first configuring that portion of the product and then configuring the parts that are not related to the user's requirements. Another decomposition strategy verifies whether the set of constraints for the product to be configured can be split into a set of noninteracting problems. In such a case the configurator solves the configuration problem by splitting the whole search space into a set of smaller search spaces. Different combinations of these two decomposition techniques are considered, and the impact of the decomposition strategies on the performance of the configurator is evaluated via a set of experiments using the configuration of computer systems as a test bed. The results of the experiments show a significant reduction of the computational effort (both in terms of number of backtrackings and in CPU time) when decomposition strategies are used.