Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Knowledge-based Configuration incorporates knowledge representation formalisms to
capture complex product models and reasoning methods to provide intelligent interactive …

Most of the algorithms developed within the Constraint Satisfaction Problem (CSP)
framework cannot be used as such to solve interactive decision support problems, like …

This article follows a tutorial, given by the authors on dynamic constraint solving at CP 2003
(Ninth International Conference on Principles and Practice of Constraint Programming) in …

In order to develop mass customization, many companies use configuration software to
customize their products. Although many studies already exist about Product Configuration …

In this paper, we expand the scope of constraint-directed scheduling techniques to deal with
the case where the scheduling problem includes alternative activities. That is, not only does …

A company develops product positioning strategy to make each product cover certain market
segmentation and meet a group of customers' requirements. In this sense, customer …

Constraints are a powerful general paradigm for representing knowledge in intelligent
systems. The standard constraint satisfaction paradigm involves variables over a discrete …

The purpose of this paper is, on the one hand, to identify to define and classify customization
requirements and, on the other hand, to evaluate how generic modeling and configuration …

Configurators have been generally accepted as important tools to elicit customers' needs
and find the matches between customers' requirements and company's offerings. With …