by Sathiamoorthy Subbarayan, Rune M. Jensen, Tarik Hadzic, Henrik R. Andersen, Henrik Hulgaard, Jesper Møller
In: CP’04 CSPIA Workshop
http://www.itu.dk/people/sathi/papers/cspia2004.pdf
Add To MetaCart
Abstract:
Abstract. A product configurator should be complete and backtrack free in the sense that the user can choose freely between any valid configuration and will be prevented from making choices that no valid configuration satisfies. In this paper, we experimentally evaluate a symbolic and search-based implementation of an interactive product configuration algorithm with these properties. Our results show that the symbolic approach often has several orders of magnitude faster response time than the search-based approach due to the precompilation of a symbolic representation of the solution space. Moreover, the difference between the average and worst response time for the symbolic approach is typically within a factor of two, whereas it for the search-based approach may be more than two orders of magnitude. 1
Citations
|
2317
|
Graph-Based Algorithms for Boolean Function Manipulation
– Bryant
- 1986
|
|
594
|
Chaff: Engineering an efficient SAT solver
– Moskewicz, Madigan, et al.
- 2001
|
|
356
|
Symbolic Model Checking: 1020 States and Beyond
– Burch, Clarke, et al.
- 1990
|
|
340
|
Network-based heuristics for constraint-satisfaction problems
– Dechter, Pearl
- 1988
|
|
103
|
Branching programs and binary decision diagrams - theory and applications
– Wegener
- 2000
|
|
55
|
Tree-clustering schemes for constraintprocessing
– Dechter, Pearl
- 1988
|
|
44
|
Product Configuration Frameworks – A Survey
– Sabin, Weigel
- 1998
|
|
44
|
CUDD: Colorado University Decision Diagram Package. ftp://vlsi.colorado.edu/pub
– Somenzi
- 1996
|
|
40
|
Ordered Binary Decision Diagrams and the Davis-Putnam procedure
– Uribe, Stickel
- 1994
|
|
36
|
A performance study of bdd-based model checking
– Yang, Bryant, et al.
- 1998
|
|
27
|
Supply restoration in power distribution systems – a benchmark for planning under uncertainty
– Thiebaux, Cordie
- 2001
|
|
27
|
On reformulation of constraint satisfaction problems
– Weigel, Bliek, et al.
- 1998
|
|
20
|
A comparative study of eight constraint programming languages over the boolean and finite domains
– Fernández, Hill
- 2000
|
|
19
|
Formal methods for the validation of automotive product configuration data
– Sinz, Kaiser, et al.
|
|
18
|
P.: Consistency restoration and explanations in dynamic CSPs-application to configuration
– Amilhastre, Fargier, et al.
- 2002
|
|
14
|
H.: Fast backtrack-free product configuration using a precompiled solution space representation
– Hadzic, Subbarayan, et al.
- 2004
|
|
13
|
T.: Algorithms and Data
– Meinel, Theobald
- 1998
|
|
10
|
Search vs. symbolic techniques in satisfiability solving
– Pan, Vardi
- 2004
|
|
10
|
CLab: A C++ library for fast backtrack-free interactive product configuration. http://www.itu.dk/people/rmj/clab
– Jensen
- 2007
|
|
7
|
Empirical Testing of a Weight Constraint Rule Based Configurator
– Tiihonen, Soininen, et al.
- 2002
|
|
7
|
Methods for interactive constraint satisfaction
– Madsen
- 2003
|
|
6
|
A Binary Decision Diagram Package. http://sourceforge.net/projects/buddy (online
– Lind-Nielsen
|
|
2
|
ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/ contributed/crawford/README
– Parity-Function
|
