Generating tradeoffs for interactive constraint-based configuration

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

In this paper we have modeled tradeoffs in constraint-based configuration as additional constraints, and begun to study the issues involved in generating and evaluating such tradeoffs. We describe our basic approach in the context of a “toy” configuration problem based on the classic N-Queens problem. Initial experiments compare “proposal strategies” for generating tradeoffs. We demonstrate that arc-consistency can be used as an effective trigger for generating tradeoff proposals in interactive configuration.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2001 - 7th International Conference, CP 2001, Proceedings
EditorsToby Walsh
PublisherSpringer Verlag
Pages590-594
Number of pages5
ISBN (Print)3540428631, 9783540428633
DOIs
Publication statusPublished - 2001
Event7th International Conference on Principles and Practice of Constraint Programming, CP 2001 - Paphos, Cyprus
Duration: 26 Nov 20011 Dec 2001

Publication series

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

Conference

Conference7th International Conference on Principles and Practice of Constraint Programming, CP 2001
Country/TerritoryCyprus
CityPaphos
Period26/11/011/12/01

Fingerprint

Dive into the research topics of 'Generating tradeoffs for interactive constraint-based configuration'. Together they form a unique fingerprint.

Cite this