Lukas Güthing

Context: Cardinality-based Feature Models (CFMs) extend classical boolean feature models with multiplicities of features. While classical FMs usually get translated to propositional logic to run analyses with SAT solvers, there are no agreed-upon similar translations for CFMs.

Goal: Develop concepts for and compare different translations for CFMs to problem instances for solvers (ILP, CSP, SMT, etc.).

Requirements: Ideally knowledge about different solvers. Prior knowledge of (software) product lines is not required but might be helpful.