Generation (or a posteriori) methods in Multi-Objective Mathematical Programming (MOMP)
is the most computationally demanding category among the MOMP approaches. Due to the …

Abstract νZ is a part of the SMT solver Z3. It allows users to pose and solve optimization
problems modulo theories. Many SMT applications use models to provide satisfying …

Many SMT problems of interest may require the capability of finding models that are optimal
wrt. some objective functions. These problems are grouped under the umbrella term of …

A feature model (FM) is a compact representation of the information of all possible products
from software product lines. The optimal feature selection involves the simultaneous …

Abstract Satisfiability Modulo Theories, SMT, solvers are used in many applications. These
applications benefit from the power of tuned and scalable theorem proving technologies for …

Software product lines (SPLs) allow stakeholders to manage product variants in a
systematical way and derive variants by selecting features. Finding a desirable variant is …

A key challenge to software product line engineering is to explore a huge space of various
products and to find optimal or near-optimal solutions that satisfy all predefined constraints …

Variability-rich software, such as software product lines, offers optional and alternative
features to accommodate varying needs of users. Designers of variability-rich software face …

Abstract Optimization Modulo Theories (OMT OMT) is an extension of SMT which allows for
finding models that optimize given objectives. OptiMathSAT is an OMT solver which allows …

Recently, it has been shown that the enumeration of Minimal Correction Subsets (MCS) of
Boolean formulas allows solving Multi-Objective Boolean Optimization (MOBO) formulations …