Abstract Testing Software Product Lines is very challenging due to a high degree of
variability leading to an enormous number of possible products. The vast majority of today's …

Abstract Software Product Lines (SPL) are difficult to validate due to combinatorics induced
by variability, which in turn leads to combinatorial explosion of the number of derivable …

In this paper we argue that an attractive and potentially very general way of achieving
generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a …

ABSTRACT Software Product Line (SPL) engineering is a popular approach for the
systematic reuse of software artifacts across a very large number of similar products. SPLs …

In product development companies mass customization is widely used to achieve better
customer satisfaction while kee** costs down. To efficiently implement mass …

We address the problem of variable and truth-value choice in modern search-based
Boolean satisfiability (SAT) solvers depending on the problem domain. The SAT problem is …

Boolean satisfiability (SAT) solvers are essential tools for many domains in computer
science and engineering. Modern complete search-based SAT solvers represent a universal …

Not all NP-complete problems share the same practical hardness with respect to exact
computation. Whereas some NP-complete problems are amenable to efficient computational …

Model-based autonomic computing systems facilitate the planning capabilities inside the
adaptation logic. However, it is challenging to capture the complete reconfiguration behavior …

Abstract Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks
widely used to represent and solve combinatorial problems. A concept of primary …