Solving combined configuration problems: A heuristic approach

Tutkimustuotos: Lehtiartikkelivertaisarvioitu


  • Martin Gebser
  • Anna Ryabokon
  • Gottfried Schenner


  • University of Klagenfurt
  • Siemens


This paper describes an abstract problem derived from a combination of Siemens product configuration problems encountered in practice. Often isolated parts of configuration problems can be solved by mapping them to well-studied problems for which efficient heuristics exist (graph coloring, bin-packing, etc.). Unfortunately, these heuristics may fail to work when applied to a problem that combines two or more subproblems. In the paper we show how to formulate a combined configuration problem in Answer Set Programming (ASP) and to solve it using heuristics a la hclasp. The latter stands for heuristic clasp that is nowadays integrated in clasp and enables the declaration of domain-specific heuristics in ASP. In addition, we present a novel method for heuristic generation based on a combination of greedy search with ASP that allows to improve the performance of clasp.


JulkaisuCEUR Workshop Proceedings
TilaJulkaistu - 2015
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
Tapahtuma International Configuration Workshop - Vienna, Itävalta
Kesto: 10 syyskuuta 201511 syyskuuta 2015
Konferenssinumero: 17

ID: 17249091