Conjunctive Query Based Constraint Solving for Feature Model Configuration

Alexander Felfernig; Viet-Man Le; Sebastian Lubos

doi:10.1007/978-3-031-36886-8_30

Conjunctive Query Based Constraint Solving for Feature Model Configuration

Alexander Felfernig, Viet-Man Le^*, Sebastian Lubos

^*Corresponding author for this work

Institute of Software Technology (7160)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

Feature model configuration can be supported on the basis of various types of reasoning approaches. Examples thereof are SAT solving, constraint solving, and answer set programming (ASP). Using these approaches requires technical expertise of how to define and solve the underlying configuration problem. In this paper, we show how to apply conjunctive queries typically supported by today’s relational database systems to solve constraint satisfaction problems (CSP) and – more specifically – feature model configuration tasks. This approach allows the application of a wide-spread database technology to solve configuration tasks and also allows for new algorithmic approaches when it comes to the identification and resolution of inconsistencies.

Original language	English
Title of host publication	The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023
Subtitle of host publication	Proceedings of the International Conference CITA 2023
Editors	Ngoc Thanh Nguyen, Hoa Le-Minh, Cong-Phap Huynh, Quang-Vu Nguyen
Place of Publication	Cham
Publisher	Springer
Pages	357–367
Number of pages	11
Volume	734
ISBN (Electronic)	978-3-031-36886-8
ISBN (Print)	978-3-031-36885-1
DOIs	https://doi.org/10.1007/978-3-031-36886-8_30
Publication status	Published - 26 Jul 2023
Event	12th Conference on Information Technology and its Applications: CITA 2023 - Vietnam - Korea University of Information and Communication Technology (VKU), Da Nang, Viet Nam Duration: 28 Jul 2023 → 29 Jul 2023 https://cita.vku.udn.vn

Publication series

Name	Lecture Notes in Networks and Systems
Volume	734 LNNS
ISSN (Print)	2367-3370
ISSN (Electronic)	2367-3389

Conference

Conference	12th Conference on Information Technology and its Applications
Abbreviated title	CITA 2023
Country/Territory	Viet Nam
City	Da Nang
Period	28/07/23 → 29/07/23
Internet address	https://cita.vku.udn.vn

Keywords

Conjunctive Query
Constraint Solving
Feature Model
Knowledge-based Configuration
Relational Database

ASJC Scopus subject areas

Signal Processing
Control and Systems Engineering
Computer Networks and Communications

Access to Document

10.1007/978-3-031-36886-8_30

Cite this

Felfernig, A., Le, V.-M., & Lubos, S. (2023). Conjunctive Query Based Constraint Solving for Feature Model Configuration. In N. T. Nguyen, H. Le-Minh, C.-P. Huynh, & Q.-V. Nguyen (Eds.), The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023 (Vol. 734, pp. 357–367). (Lecture Notes in Networks and Systems; Vol. 734 LNNS). Springer. https://doi.org/10.1007/978-3-031-36886-8_30

Conjunctive Query Based Constraint Solving for Feature Model Configuration. / Felfernig, Alexander ; Le, Viet-Man ; Lubos, Sebastian.
The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023. ed. / Ngoc Thanh Nguyen; Hoa Le-Minh; Cong-Phap Huynh; Quang-Vu Nguyen. Vol. 734 Cham: Springer, 2023. p. 357–367 (Lecture Notes in Networks and Systems; Vol. 734 LNNS).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Felfernig, A , Le, V-M & Lubos, S 2023, Conjunctive Query Based Constraint Solving for Feature Model Configuration. in NT Nguyen, H Le-Minh, C-P Huynh & Q-V Nguyen (eds), The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023. vol. 734, Lecture Notes in Networks and Systems, vol. 734 LNNS, Springer, Cham, pp. 357–367, 12th Conference on Information Technology and its Applications, Da Nang, Viet Nam, 28/07/23. https://doi.org/10.1007/978-3-031-36886-8_30

Felfernig A , Le VM , Lubos S. Conjunctive Query Based Constraint Solving for Feature Model Configuration. In Nguyen NT, Le-Minh H, Huynh CP, Nguyen QV, editors, The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023. Vol. 734. Cham: Springer. 2023. p. 357–367. (Lecture Notes in Networks and Systems). doi: 10.1007/978-3-031-36886-8_30

Felfernig, Alexander ; Le, Viet-Man ; Lubos, Sebastian. / Conjunctive Query Based Constraint Solving for Feature Model Configuration. The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023. editor / Ngoc Thanh Nguyen ; Hoa Le-Minh ; Cong-Phap Huynh ; Quang-Vu Nguyen. Vol. 734 Cham : Springer, 2023. pp. 357–367 (Lecture Notes in Networks and Systems).

@inproceedings{cda833470708466abaf51af01e5bdc5a,

title = "Conjunctive Query Based Constraint Solving for Feature Model Configuration",

abstract = "Feature model configuration can be supported on the basis of various types of reasoning approaches. Examples thereof are SAT solving, constraint solving, and answer set programming (ASP). Using these approaches requires technical expertise of how to define and solve the underlying configuration problem. In this paper, we show how to apply conjunctive queries typically supported by today{\textquoteright}s relational database systems to solve constraint satisfaction problems (CSP) and – more specifically – feature model configuration tasks. This approach allows the application of a wide-spread database technology to solve configuration tasks and also allows for new algorithmic approaches when it comes to the identification and resolution of inconsistencies.",

keywords = "Conjunctive Query, Constraint Solving, Feature Model, Knowledge-based Configuration, Relational Database",

author = "Alexander Felfernig and Viet-Man Le and Sebastian Lubos",

year = "2023",

month = jul,

day = "26",

doi = "10.1007/978-3-031-36886-8_30",

language = "English",

isbn = "978-3-031-36885-1",

volume = "734",

series = "Lecture Notes in Networks and Systems",

publisher = "Springer",

pages = "357–367",

editor = "Nguyen, {Ngoc Thanh} and Hoa Le-Minh and Cong-Phap Huynh and Quang-Vu Nguyen",

booktitle = "The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023",

note = "12th Conference on Information Technology and its Applications : CITA 2023, CITA 2023 ; Conference date: 28-07-2023 Through 29-07-2023",

url = "https://cita.vku.udn.vn",

}

TY - GEN

T1 - Conjunctive Query Based Constraint Solving for Feature Model Configuration

AU - Felfernig, Alexander

AU - Le, Viet-Man

AU - Lubos, Sebastian

PY - 2023/7/26

Y1 - 2023/7/26

N2 - Feature model configuration can be supported on the basis of various types of reasoning approaches. Examples thereof are SAT solving, constraint solving, and answer set programming (ASP). Using these approaches requires technical expertise of how to define and solve the underlying configuration problem. In this paper, we show how to apply conjunctive queries typically supported by today’s relational database systems to solve constraint satisfaction problems (CSP) and – more specifically – feature model configuration tasks. This approach allows the application of a wide-spread database technology to solve configuration tasks and also allows for new algorithmic approaches when it comes to the identification and resolution of inconsistencies.

AB - Feature model configuration can be supported on the basis of various types of reasoning approaches. Examples thereof are SAT solving, constraint solving, and answer set programming (ASP). Using these approaches requires technical expertise of how to define and solve the underlying configuration problem. In this paper, we show how to apply conjunctive queries typically supported by today’s relational database systems to solve constraint satisfaction problems (CSP) and – more specifically – feature model configuration tasks. This approach allows the application of a wide-spread database technology to solve configuration tasks and also allows for new algorithmic approaches when it comes to the identification and resolution of inconsistencies.

KW - Conjunctive Query

KW - Constraint Solving

KW - Feature Model

KW - Knowledge-based Configuration

KW - Relational Database

UR - http://www.scopus.com/inward/record.url?scp=85172029889&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-36886-8_30

DO - 10.1007/978-3-031-36886-8_30

M3 - Conference paper

SN - 978-3-031-36885-1

VL - 734

T3 - Lecture Notes in Networks and Systems

SP - 357

EP - 367

BT - The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023

A2 - Nguyen, Ngoc Thanh

A2 - Le-Minh, Hoa

A2 - Huynh, Cong-Phap

A2 - Nguyen, Quang-Vu

PB - Springer

CY - Cham

T2 - 12th Conference on Information Technology and its Applications

Y2 - 28 July 2023 through 29 July 2023

ER -