Comparing two implementations of a Complete and Backtrack-free Interactive Configurator

Sathiamoorthy Subbarayan, Rune Møller Jensen, Tarik Hadzic, Henrik Reif Andersen, Henrik Hulgaard, Jesper Møller

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationProceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP-04) Workshop on CSP Techniques with Immediate Application
Number of pages15
Publication date2004
Publication statusPublished - 2004


Dive into the research topics of 'Comparing two implementations of a Complete and Backtrack-free Interactive Configurator'. Together they form a unique fingerprint.

Cite this