Interactive Configuration based on Incremental Constraint Satisfaction

Gelle, Esther; Weigel, Rainer

doi:10.1007/978-0-387-34930-5_9

Cited by 9 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic CSPs [14], for instance suit the problems where the existence of some optional variables depends on the value of another variable. Other extensions proposed by the CSP community include composite CSPs [18], interactive CSPs [10], hypothesis CSPs [2], generative constraint satisfaction [21], [9], etc. Some of the characteristics taken into account by these formalisms may happen in our application, but they are not so crucial.…”

Section: B Specificities Of the Constraint-based Representation Of Amentioning

confidence: 99%

Constraint-based Vehicle Configuration: A Case Study

Astesana

Cosserat

Fargier

2010

2010 22nd IEEE International Conference on Tools With Artificial Intelligence

View full text Add to dashboard Cite

The existence of powerful constraint satisfaction algorithms is not the sole reason of the wide success of the CSP framework. The interest of this framework is also that it offers a generic and simple way for the modeling of real world applications. Nevertheless these applications call for tasks that often differ from a classical search for a solution. The aim of the present paper is not to provide the AI community with new and efficient algorithms, but with new requests and more generally new needs. All of them are issued from the analysis of the business needs that arise around the design and exploitation of the vehicle range at Renault, the French car manufacturer. Viewing this application as a fruitful source of research problematics for the community, we present a formalization and a theoretical study, in terms on complexity, of the series of requests risen by the application.

show abstract

Section: B Specificities Of the Constraint-based Representation Of Amentioning

confidence: 99%

Constraint-based Vehicle Configuration: A Case Study

Astesana

Cosserat

Fargier

2010

2010 22nd IEEE International Conference on Tools With Artificial Intelligence

View full text Add to dashboard Cite

show abstract

“…Several authors [22,27,32,39] have proposed to extend the CSP framework so as to handle configuration problems-the extension dealing mainly with the difficulties that are inherent to the structure of configuration problems. The handling of another salient feature of configuration problems, namely their interactivity, has prevailed on us to extend the framework in another direction and to define "Assumption-based CSPs".…”

Section: Resultsmentioning

confidence: 99%

“…In this context, the set of variables of the problem cannot be defined a priori. Several authors have proposed to extend the classical CSP framework in order to handle such structural characteristics[22,27,32,35,39]. However, these works do not address interactivity in the configuration task since they assume that the whole set of user's requirements is given at start.…”

mentioning

confidence: 99%

Consistency restoration and explanations in dynamic CSPs—Application to configuration

Amilhastre¹,

Fargier

Marquis

2002

Artificial Intelligence

135

View full text Add to dashboard Cite

Most of the algorithms developed within the Constraint Satisfaction Problem (CSP) framework cannot be used as such to solve interactive decision support problems, like product configuration. Indeed, in such problems, the user is in charge of assigning values to variables. Global consistency maintaining is only one among several functionalities that should be offered by a CSP-based platform in order to help the user in her task; other important functionalities include providing explanations for some user's choices and ways to restore consistency. This paper presents an extension of the CSP framework in this direction. The key idea consists in considering and handling the user's choices as assumptions. From a theoretical point of view, the complexity issues of various computational tasks involved in interactive decision support problems are investigated. The results cohere with what is known when Boolean constraints are considered and show all the tasks intractable in the worst case. Since interactivity requires short response times, intractability must be circumvented some way. To this end, we present a new method for compiling configuration problems, that can be generalized to valued CSPs. Specifically, an automaton representing the set of solutions of the CSP is first computed off-line, then this data structure is exploited so as to ensure both consistency maintenance and computation of maximal consistent subsets of user's choices in an efficient way.

show abstract

“…We have identified two other classes of knowledge − heuristic and strategic − which also benefit from logical formalism and separate, explicit representation, avoiding the traditional production rule systems' confusion of these classes with their consequent maintainability problems (McDermott, 1982). Our constructive type theory would seem to have much in common with various constraint based approaches (Faltings & Weigel, 1994;Sabin & Freuder, 1996;Gelle & Weigel, 1996). The special class of constraint-based reasoning in which the configuration is being gradually refined (see ten Teije et al, 1996) is akin to our approach of gradually synthesizing a configuration from a specification by defining complex types, culminating with the configuration type, whose slots are eventually fully instantiated with sub-parts.…”

Section: Related and Further Workmentioning

confidence: 99%

Proof planning for maintainable configuration systems

Lowe

Pěchouček

Bundy

1998

AIEDAM

View full text Add to dashboard Cite

Configuration is a complex task generally involving varying measures of constraint satisfaction, optimization, and the management of soft constraints. Although many successful systems have been developed, these are often difficult to maintain and to generalize in rapidly changing domains. In this paper, we consider building intelligent knowledge-based systems with maintainability well to the fore in our requirements for such systems. We introduce two case studies: the initial proof of concept, which was in the domain of computer configuration, and a further field-tested study, the configuration of compressors. Central to our approach is the use of the proof planning technique, and the clean separation of different kinds of knowledge: factual, heuristic, and strategic.

show abstract

Interactive Configuration based on Incremental Constraint Satisfaction

Cited by 9 publications

References 2 publications

Constraint-based Vehicle Configuration: A Case Study

Constraint-based Vehicle Configuration: A Case Study

Consistency restoration and explanations in dynamic CSPs—Application to configuration

Proof planning for maintainable configuration systems

Contact Info

Product

Resources

About