Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
From extended feature models to constraint logic programming
Date
2013-12-01
Author
KARATAS, Ahmet Serkan
Oğuztüzün, Mehmet Halit S.
Dogru, Ali
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
152
views
0
downloads
Cite This
Since 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; basic, cardinality-based and extended feature models, which can include complex cross-tree relationships involving attributes. This translation enables the use of off-the-shelf constraint solvers for the automated analysis of extended feature models involving such complex relationships. We also present the performance results of some well-known analysis operations on an example translated model.
Subject Keywords
Variability modeling
,
Extended feature model
,
Feature attribute
,
Constraint logic programming
URI
https://hdl.handle.net/11511/41906
Journal
SCIENCE OF COMPUTER PROGRAMMING
DOI
https://doi.org/10.1016/j.scico.2012.06.004
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains
KARATAS, Ahmet Serkan; OGUZTUZUN, Halit; Doğru, Ali Hikmet (2010-09-17)
As feature models for realistic product families may be quite complicated, automated analysis of feature models is desirable. Although several approaches reported in the literature addressed this issue, complex feature-attribute and attribute-attribute relationships in extended feature models were not handled effectively. In this article, we introduce a mapping from extended feature models to constraint logic programming over finite domains. This mapping is used to translate basic, cardinality-based, and ex...
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...
Transforming cross-tree relations involving attributes into basic constraints in feature models
Karataş, Ahmet Serkan; Oğuztüzün, Mehmet Halit S.; Doǧru, Ali (2011-12-01)
Extended feature models enable expressing powerful constraints by involving feature attributes in cross-tree relations. However, most of the existing methods for the automated analysis of feature models are not devised to handle such models. In this paper we define a transformation to remove such cross-tree relations, which is applicable when certain restrictions hold. This transformation takes an extended feature model with cross-tree relations involving attributes and constructs a semantically equivalent ...
A cluster tree based model selection approach for logistic regression classifier
Tanju, Ozge; Kalaylıoğlu Akyıldız, Zeynep Işıl (Informa UK Limited, 2018-01-01)
Model selection methods are important to identify the best approximating model. To identify the best meaningful model, purpose of the model should be clearly pre-stated. The focus of this paper is model selection when the modelling purpose is classification. We propose a new model selection approach designed for logistic regression model selection where main modelling purpose is classification. The method is based on the distance between the two clustering trees. We also question and evaluate the performanc...
FMML: A Feature Model Markup Language
NABDEL, Leili; Karatas, Ahmet Serkan; Oğuztüzün, Mehmet Halit S.; Dogru, Ali (2011-09-25)
Feature modeling is a common way of representing commonality and variability in Software Product Line Engineering. Alternative notations are available to represent feature models. Compared with graphical notations, text-based notations can be more amenable to automated processing and tool interoperability. In this paper, we propose an XML-based feature modeling language to represent extended feature models with complex relationships.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. S. KARATAS, M. H. S. Oğuztüzün, and A. Dogru, “From extended feature models to constraint logic programming,”
SCIENCE OF COMPUTER PROGRAMMING
, pp. 2295–2312, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41906.