2013
DOI: 10.1016/j.scico.2012.06.004
|View full text |Cite
|
Sign up to set email alerts
|

From extended feature models to constraint logic programming

Abstract: a b s t r a c tSince feature models for realistic product families may be quite complicated, the automated analysis of feature models is desirable. Although several approaches reported in the literature address this issue, complex cross-tree relationships involving attributes in extended feature models have not been handled. In this article, we introduce a mapping from extended feature models to constraint logic programming over finite domains. This mapping is used to translate into constraint logic programs; … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0
1

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(18 citation statements)
references
References 31 publications
0
17
0
1
Order By: Relevance
“…Currently, we are evaluating the applicability of VM as a generic attributed feature modeling language such as SXFM, TVL or FAMA. In the VM repository https://github.com/ ViViD-DiverSE/VM-Source we have VM models that support the point that VM is expressive enough to encode existing boolean and attributed feature models found in the literature and public repositories (e.g., mobile media [18] and the SPLOT repository www.splot-research.org).…”
Section: Comparison With Existing Solutionsmentioning
confidence: 88%
“…Currently, we are evaluating the applicability of VM as a generic attributed feature modeling language such as SXFM, TVL or FAMA. In the VM repository https://github.com/ ViViD-DiverSE/VM-Source we have VM models that support the point that VM is expressive enough to encode existing boolean and attributed feature models found in the literature and public repositories (e.g., mobile media [18] and the SPLOT repository www.splot-research.org).…”
Section: Comparison With Existing Solutionsmentioning
confidence: 88%
“…More particularly, the conceptualization included languages that (1) have been transformed to logic or constraint programming to automate analysis tasks; and (2) their semantics is formally defined, and were included in other conceptualization studies. Hence, this step included feature-oriented languages [5,13,14,26]; variation point oriented languages [8,12,20,22,23]; and decision-oriented languages [4,6,7,25]. Finally, the review included proposals introducing constructs for modeling complex variability relations, such as conditional and quantified constraints [8,14,21].…”
Section: Designing Hlvl Following An Ontological Approachmentioning
confidence: 99%
“…This condition can be simple as in FODA requires and excludes constructs where the inclusion/exclusion of a feature B is conditioned to the inclusion of a feature A. Languages such as CO-OVM [8], and extended-feature models in [14] allow the usage of complex expressions to condition the inclusion/exclusion of variable items using logical expressions.…”
Section: Variability Relationsmentioning
confidence: 99%
“…For instance, [3,5] encode an EFM with cardinalities into a CSP and use a solver to validate and perform some analyses on the FMs. Karata ¸s et al [13,14] extend that approach to encode complex CTCs related to an EFM, which involve feature-feature, feature-attribute, and attribute-attribute relations; and to introduce a larger set of analysis operations. Similarly, Salinesi et al [35] encode an EFM into a CSP by considering arithmetic, boolean, and reified constraints.…”
Section: Configuration Process As a Constraint Satisfaction Problemmentioning
confidence: 99%