The monotone circuit complexity of Boolean functions
Combinatorica
Efficient prime factorization of logic expressions
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
SIAM Journal on Discrete Mathematics
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
Generic semantics of feature diagrams
Computer Networks: The International Journal of Computer and Telecommunications Networking
Feature Diagrams and Logics: There and Back Again
SPLC '07 Proceedings of the 11th International Software Product Line Conference
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics
Improved Polynomial Identity Testing for Read-Once Formulas
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
| Hi-index | 0.00 |
In this paper we study constraints--inter-dependencies between basic features in a feature model which are not captured by diagrams. We offer a method for the removal of these constraints and explain why their removal require an (inevitable) exponential increase to the tree size. We show that the elimination of constraints makes it possible to provide an efficient solution for the feature editing problem, recently raised by Thüm, Batory and Kästner. We tie feature models with computer science fields which may appear very foreign to our domain, including circuit complexity, graph algorithms and algebraic complexity. The objective of this tie is double folded: drawing the attention of the foreign community to the problems we address in our field, and to suggest the use of current results in these fields for better understanding of the mathematics behind the modeling of software product lines.