Computing explanations and implications in preference-based configurators

Eugene C. Freuder; Chavalit Likitvivatanavong; Manuela Moretti; Francesca Rossi; Richard J. Wallace

doi:10.1007/3-540-36607-5_6

Computing explanations and implications in preference-based configurators

Eugene C. Freuder
, Chavalit Likitvivatanavong
, Manuela Moretti
, Francesca Rossi
, Richard J. Wallace

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

Abstract

We consider configuration problems with preferences rather than just hard constraints, and we analyze and discuss the features that such configurators should have. In particular, these configurators should provide explanations for the current state, implications of a future choice, and also information about the quality of future solutions, all with the aim of guiding the user in the process of making the right choices to obtain a good solution. We then describe our implemented system, which, by taking the soft n-queens problem as an example, shows that it is indeed possible, even in this very general context of preference-based configurators, to automatically compute all the information needed for the desired features. This is done by keeping track of the inferences that are made during the constraint propagation enforcing phases.

Original language	English
Title of host publication	Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers
Editors	Barry O'Sullivan
Publisher	Springer Verlag
Pages	76-92
Number of pages	17
ISBN (Print)	9783540366072
DOIs	https://doi.org/10.1007/3-540-36607-5_6
Publication status	Published - 2003
Event	Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, 2002 - Cork, Ireland Duration: 19 Jun 2002 → 21 Jun 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2627
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, 2002
Country/Territory	Ireland
City	Cork
Period	19/06/02 → 21/06/02

Access to Document

10.1007/3-540-36607-5_6

Cite this

Freuder, E. C., Likitvivatanavong, C., Moretti, M., Rossi, F., & Wallace, R. J. (2003). Computing explanations and implications in preference-based configurators. In B. O'Sullivan (Ed.), Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers (pp. 76-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2627). Springer Verlag. https://doi.org/10.1007/3-540-36607-5_6

Freuder, Eugene C. ; Likitvivatanavong, Chavalit ; Moretti, Manuela et al. / Computing explanations and implications in preference-based configurators. Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers. editor / Barry O'Sullivan. Springer Verlag, 2003. pp. 76-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fdc7665791c04a018a2ba920faae08a9,

title = "Computing explanations and implications in preference-based configurators",

abstract = "We consider configuration problems with preferences rather than just hard constraints, and we analyze and discuss the features that such configurators should have. In particular, these configurators should provide explanations for the current state, implications of a future choice, and also information about the quality of future solutions, all with the aim of guiding the user in the process of making the right choices to obtain a good solution. We then describe our implemented system, which, by taking the soft n-queens problem as an example, shows that it is indeed possible, even in this very general context of preference-based configurators, to automatically compute all the information needed for the desired features. This is done by keeping track of the inferences that are made during the constraint propagation enforcing phases.",

author = "Freuder, \{Eugene C.\} and Chavalit Likitvivatanavong and Manuela Moretti and Francesca Rossi and Wallace, \{Richard J.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2003.; Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, 2002 ; Conference date: 19-06-2002 Through 21-06-2002",

year = "2003",

doi = "10.1007/3-540-36607-5\_6",

language = "English",

isbn = "9783540366072",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "76--92",

editor = "Barry O'Sullivan",

booktitle = "Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers",

address = "Germany",

}

Freuder, EC, Likitvivatanavong, C, Moretti, M, Rossi, F & Wallace, RJ 2003, Computing explanations and implications in preference-based configurators. in B O'Sullivan (ed.), Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2627, Springer Verlag, pp. 76-92, Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, 2002, Cork, Ireland, 19/06/02. https://doi.org/10.1007/3-540-36607-5_6

Computing explanations and implications in preference-based configurators. / Freuder, Eugene C.; Likitvivatanavong, Chavalit; Moretti, Manuela et al.
Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers. ed. / Barry O'Sullivan. Springer Verlag, 2003. p. 76-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2627).

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

TY - GEN

T1 - Computing explanations and implications in preference-based configurators

AU - Freuder, Eugene C.

AU - Likitvivatanavong, Chavalit

AU - Moretti, Manuela

AU - Rossi, Francesca

AU - Wallace, Richard J.

PY - 2003

Y1 - 2003

N2 - We consider configuration problems with preferences rather than just hard constraints, and we analyze and discuss the features that such configurators should have. In particular, these configurators should provide explanations for the current state, implications of a future choice, and also information about the quality of future solutions, all with the aim of guiding the user in the process of making the right choices to obtain a good solution. We then describe our implemented system, which, by taking the soft n-queens problem as an example, shows that it is indeed possible, even in this very general context of preference-based configurators, to automatically compute all the information needed for the desired features. This is done by keeping track of the inferences that are made during the constraint propagation enforcing phases.

AB - We consider configuration problems with preferences rather than just hard constraints, and we analyze and discuss the features that such configurators should have. In particular, these configurators should provide explanations for the current state, implications of a future choice, and also information about the quality of future solutions, all with the aim of guiding the user in the process of making the right choices to obtain a good solution. We then describe our implemented system, which, by taking the soft n-queens problem as an example, shows that it is indeed possible, even in this very general context of preference-based configurators, to automatically compute all the information needed for the desired features. This is done by keeping track of the inferences that are made during the constraint propagation enforcing phases.

UR - https://www.scopus.com/pages/publications/7044231003

U2 - 10.1007/3-540-36607-5_6

DO - 10.1007/3-540-36607-5_6

M3 - Conference proceeding

AN - SCOPUS:7044231003

SN - 9783540366072

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 92

BT - Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers

A2 - O'Sullivan, Barry

PB - Springer Verlag

T2 - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, 2002

Y2 - 19 June 2002 through 21 June 2002

ER -

Freuder EC, Likitvivatanavong C, Moretti M, Rossi F, Wallace RJ. Computing explanations and implications in preference-based configurators. In O'Sullivan B, editor, Recent Advances in Constraints - Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Selected Papers. Springer Verlag. 2003. p. 76-92. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36607-5_6

Computing explanations and implications in preference-based configurators

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this