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

^*Korrespondierende/r Autor/-in für diese Arbeit

Institut für Softwaretechnologie (7160)

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

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.

Originalsprache	englisch
Titel	The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023
Untertitel	Proceedings of the International Conference CITA 2023
Redakteure/-innen	Ngoc Thanh Nguyen, Hoa Le-Minh, Cong-Phap Huynh, Quang-Vu Nguyen
Erscheinungsort	Cham
Herausgeber (Verlag)	Springer
Seiten	357–367
Seitenumfang	11
Band	734
ISBN (elektronisch)	978-3-031-36886-8
ISBN (Print)	978-3-031-36885-1
DOIs	https://doi.org/10.1007/978-3-031-36886-8_30
Publikationsstatus	Veröffentlicht - 26 Juli 2023
Veranstaltung	12th Conference on Information Technology and its Applications: CITA 2023 - Vietnam - Korea University of Information and Communication Technology (VKU), Da Nang, Vietnam Dauer: 28 Juli 2023 → 29 Juli 2023 https://cita.vku.udn.vn

Publikationsreihe

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

Konferenz

Konferenz	12th Conference on Information Technology and its Applications
Kurztitel	CITA 2023
Land/Gebiet	Vietnam
Ort	Da Nang
Zeitraum	28/07/23 → 29/07/23
Internetadresse	https://cita.vku.udn.vn

ASJC Scopus subject areas

Signalverarbeitung
Steuerungs- und Systemtechnik
Computernetzwerke und -kommunikation

Zugriff auf Dokument

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

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Conjunctive Query Based Constraint Solving for Feature Model Configuration
Viet Man Le (Redner/in)
29 Juli 2023
Aktivität: Vortrag oder Präsentation › Vortrag bei Konferenz oder Fachtagung › Science to science

Dieses zitieren

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 (Hrsg.), The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023 (Band 734, S. 357–367). (Lecture Notes in Networks and Systems; Band 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. Hrsg. / Ngoc Thanh Nguyen; Hoa Le-Minh; Cong-Phap Huynh; Quang-Vu Nguyen. Band 734 Cham: Springer, 2023. S. 357–367 (Lecture Notes in Networks and Systems; Band 734 LNNS).

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

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 (Hrsg.), The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023. Bd. 734, Lecture Notes in Networks and Systems, Bd. 734 LNNS, Springer, Cham, S. 357–367, 12th Conference on Information Technology and its Applications, Da Nang, Vietnam, 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, Hrsg., The 12th Conference on Information Technology and Its Applications - Proceedings of the International Conference CITA 2023: Proceedings of the International Conference CITA 2023. Band 734. Cham: Springer. 2023. S. 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. Hrsg. / Ngoc Thanh Nguyen ; Hoa Le-Minh ; Cong-Phap Huynh ; Quang-Vu Nguyen. Band 734 Cham : Springer, 2023. S. 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 -

Conjunctive Query Based Constraint Solving for Feature Model Configuration

Abstract

Publikationsreihe

Konferenz

ASJC Scopus subject areas

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Aktivitäten

Conjunctive Query Based Constraint Solving for Feature Model Configuration

Dieses zitieren