Multi–target implementation of a domain specific language for extended feature models

Demirtaş, Görkem
Translation of feature models to constraint logic programs is an effective method to enable their automated analysis using existing constraint solvers. More flexibility can be offered for building and application of analysis operations on extended feature models by providing a syntax and mechanism for interfacing the host solver with user defined constraint predicates. These constraints, such as global constraints, can be provided by the constraint solver runtime or by the translator itself as a part of the output. The translator defines a specific parameter passing mechanism for each target environment to be used by the programmer who creates the binding between the translator and the environment. These constraint predicates can use external data sources such as relational databases and application specific algorithms thus separating the concerns of building the model and incorporating domain requirements in analysis steps. In practice such constraints reduce the labeling possibilities for the solver, thereby narrowing down the set of results, i.e. a product’s configurations. We describe the design and implementation of an extended feature model compiler supporting syntax for arbitrary predicates, that targets multiple constraint solvers.


Global Constraints on Feature Models
KARATAS, Ahmet Serkan; OGUZTUZUN, Halit; Doğru, Ali Hikmet (2010-09-10)
Feature modeling has been found very effective for modeling and managing variability in Software Product Lines. The nature of feature models invites, sometimes even requires, the use of global constraints. This paper lays the groundwork for the inclusion of global constraints in automated reasoning on feature models. We present a mapping from extended feature models to constraint logic programming over finite domains, and show that this mapping enables using global constraints on feature attributes, as well...
LinGraph: a graph-based automated planner for concurrent task planning based on linear logic
Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01)
In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
Analysis of extended feature models with constraint programming
Karataş, Ahmet Serkan; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2010)
In this dissertation we lay the groundwork of automated analysis of extended feature models with constraint programming. Among different proposals, feature modeling has proven to be very effective for modeling and managing variability in Software Product Lines. However, industrial experiences showed that feature models often grow too large with hundreds of features and complex cross-tree relationships, which necessitates automated analysis support. To address this issue we present a mapping from extended fe...
Multi-objective multi-item fixed-charge solid transportation problem under twofold uncertainty
Roy, Sankar Kumar; Midya, Sudipta; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2019-12-01)
In this paper, we investigate a multi-objective multi-item fixed-charge solid transportation problem (MOMIFCSTP) with fuzzy-rough variables as coefficients of the objective functions and of the constraints. The main focus of the paper is to analyze MOMIFCSTP under a fuzzy-rough environment for a transporting system. In practical situations, the parameters of a MOMIFCSTP are imprecise in nature, due to several uncontrollable factors. For these reasons, we introduce the fuzzy-rough variables in MOMIFCSTP to t...
Improving reinforcement learning by using sequence trees
Girgin, Sertan; Polat, Faruk; Alhajj, Reda (Springer Science and Business Media LLC, 2010-12-01)
This paper proposes a novel approach to discover options in the form of stochastic conditionally terminating sequences; it shows how such sequences can be integrated into the reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure during the learning process. The constructed tree facilitates the process of identifying frequently used action sequences together with states that are visit...
Citation Formats
G. Demirtaş, “Multi–target implementation of a domain specific language for extended feature models,” M.S. - Master of Science, Middle East Technical University, 2018.