Abstract
AbstractFeature models are commonly used to specify the valid configurations of product lines. As industrial feature models are typically complex, researchers and practitioners employ various automated analyses to study the configuration spaces. Many of these automated analyses require that numerous complex computations are executed on the same feature model, for example by querying a SAT or SATsolver. With knowledge compilation, feature models can be compiled in a one-time effort to a target language that enables polynomial-time queries for otherwise more complex problems. In this work, we elaborate on the potential of employing knowledge compilation on feature models. First, we gather various feature-model analyses and study their computational complexity with regard to the underlying computational problem and the number of solver queries required for the respective analysis. Second, we collect knowledge-compilation target languages and map feature-model analyses to the languages that make the analysis tractable. Third, we empirically evaluate publicly available knowledge compilers to further inspect the potential benefits of knowledge-compilation target languages.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Configuring BDD Compilation Techniques for Feature Models;28th ACM International Systems and Software Product Line Conference;2024-09-02
2. On the Use of Multi-valued Decision Diagrams to Count Valid Configurations of Feature Models;28th ACM International Systems and Software Product Line Conference;2024-09-02
3. How Easy is SAT-Based Analysis of a Feature Model?;Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems;2024-02-07
4. UnWise: High T-Wise Coverage from Uniform Sampling;Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems;2024-02-07