Fast Backtrack-free Product Configuration Using a Precompiled Solution Space Representation

@inproceedings{Hadzic2004FastBP,
  title={Fast Backtrack-free Product Configuration Using a Precompiled Solution Space Representation},
  author={Tarik Hadzic and Sathiamoorthy Subbarayan and Rune M. Jensen and Henrik Reif Andersen and Jesper M\oller and Henrik Hulgaard},
  year={2004}
}
In this paper we describe a two-phase approach to interactive product configuration. In the first phase, a compressed symbolic representation of the set of valid configurations (the solution space) is compiled offline. In the second phase, this representation is embedded in an online configurator and utilized for fast, complete, and backtrack-free interactive product configuration. The main advantage of our approach compared to online search-based approaches is that we avoid searching for valid… CONTINUE READING
Highly Cited
This paper has 111 citations. REVIEW CITATIONS
68 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 68 extracted citations

112 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

P.Marquis: Consistency restoration and explanations in dynamic CSPs—application to configuration

  • J. Amilhastre, H. Fargier
  • Artificial Intelligence,
  • 2002
Highly Influential
4 Excerpts

Methods for Interactive Constraint Satisfaction

  • J. N. Madsen
  • M.Sc. Thesis, Department of Computer Science…
  • 2003
1 Excerpt

Faltings : Compiling constraint satisfaction problems

  • B. Weigel
  • Pre - Proceedings of the 6 th European Conference…
  • 2000

BuDDy - A Binary Decision Diagram Package

  • J. Lind-Nielsen
  • Technical Report IT-TR: 1999-028,
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…