The original algorithm for the SAT problem, Variable Elimination Resolution (VER/DP) has exponential space complexity. To tackle that, the backtracking based DPLL procedure [2] is used in SATâ€¦ (More)

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)â€¦ (More)

When BDDs are used for propagation in a constraint solver with nogood recording, it is necessary to find a small subset of a given set of variable assignments that is enough for a BDD to imply a newâ€¦ (More)

In this project we present, the tree-of-BDDs approach, a decomposition scheme for compiling configuration problems. We also present efficient techniques for generating minimum explanations in theâ€¦ (More)

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â€¦ (More)

We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of the presented queryâ€¦ (More)

Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of realistic instances.â€¦ (More)

Quick responses are required for interactive configuration. For this an ideal interactive configurator needs to provide the functionalities required for interactive configuration with at most linearâ€¦ (More)

We present an empirical comparison of decomposition techniques for CSPs. We compare three popular heuristics for tree decomposition and an exact method for optimal tree decomposition, along with twoâ€¦ (More)

The constraint satisfaction problem (CSP) instances modeling problems occurring in practice often have structures which can be exploited to speed-up the constraint solving process. This thesisâ€¦ (More)