On the benefits of knowledge compilation for feature-model analyses

DOI10.1007/s10472-023-09906-6MaRDI QIDQ6630715

Heiko Raab, Sebastian Krieter, Tobias Heß, Chico Sundermann, Elias Kuiter, Thomas Thüm

Publication date: 31 October 2024

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

SATknowledge compilationfeature modeling\(\#\)SAT

Mathematics Subject Classification ID

Computer science (68-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Efficient manipulation of decision diagrams
• Exploiting treewidth for projected model counting and its limits
• Encoding cardinality constraints using multiway merge selection networks
• On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
• $$\#\exists $$ SAT: Projected Model Counting
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Graph-Based Algorithms for Boolean Function Manipulation
• The Complexity of Enumeration and Reliability Problems
• Algorithms for computing backbones of propositional formulae
• Logic in Computer Science
• Knowledge Compilation meets Uniform Sampling
• Implementing Efficient All Solutions SAT Solvers
• Theory and Applications of Satisfiability Testing
• Decomposable negation normal form
• Software Product Line Engineering
• Using experimental design to find effective parameter settings for heuristics

This page was built for publication: On the benefits of knowledge compilation for feature-model analyses