Solving Constraint Satisfaction Problems with Database Queries: An Overview

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Abstract

Knowledge-based configuration tasks are often solved on the basis of constraint programming. Using constraint programming requires technical expertise regarding problem specification and – to some extent – also solution search, for example, in terms of being confronted with the definition of search heuristics. In this paper, we show how to apply database queries to solve knowledge-based configuration tasks. Using this approach, configuration tasks can be defined and solved without the need of integrating a potentially new technology, but rather stick with technical infrastructures (i.e., relational databases) already existing in the company.

Original languageEnglish
Title of host publicationProceedings of the 25th International Workshop on Configuration (ConfWS 2023)
Pages29-33
Number of pages5
Volume3509
Publication statusPublished - 16 Oct 2023
Event25th International Workshop on Configuration: ConfWS 2023 - E.T.S. Ingeniería Informática, Universidad de Málaga, Spain, Málaga, Spain
Duration: 6 Sept 20237 Sept 2023
https://confws.github.io
https://confws.github.io/

Publication series

NameCEUR Workshop Proceedings
PublisherRWTH Aachen
ISSN (Print)1613-0073

Workshop

Workshop25th International Workshop on Configuration
Abbreviated titleConfWS 2023
Country/TerritorySpain
CityMálaga
Period6/09/237/09/23
Internet address

Keywords

  • Constraint Solving
  • Database Queries
  • Knowledge-based Configuration

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Solving Constraint Satisfaction Problems with Database Queries: An Overview'. Together they form a unique fingerprint.

Cite this