Combining Heuristics for Configuration Problems Using Answer Set Programming

Gebser, Martin; Ryabokon, Anna; Schenner, Gottfried

doi:10.1007/978-3-319-23264-5_32

Cited by 11 publications

(39 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Combined Configuration (Gebser, Ryabokon, & Schenner, 2015b) is a Decision problem inspired by industrial product configuration tasks dealing with railway interlocking systems, automation systems, etc. In the considered scenario, orthogonal requirements as encountered in bin packing, graph coloring, matching, partitioning, and routing must be fulfilled by a common solution.…”

Section: New Domainsmentioning

confidence: 99%

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

Self Cite

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely related problemsolving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning. This edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the topperforming systems are given more time for solving hard benchmarks.

show abstract

Section: New Domainsmentioning

confidence: 99%

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

Self Cite

View full text Add to dashboard Cite

show abstract

“…To overcome the runtime performance issue modern solvers employ various techniques. Among them the ability to use domain-specific heuristics is fundamental to solve complex problems [29]. In one approach [24] heuristics are specified using a dedicated declarative language as a part of the encoding.…”

Section: Introductionmentioning

confidence: 99%

Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

Taupe

Schekotihin

Schüller

et al. 2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Domain-specific heuristics are an important technique for solving combinatorial problems efficiently. We propose a novel semantics for declarative specifications of domain-specific heuristics in Answer Set Programming (ASP). Decision procedures that are based on a partial solution are a frequent ingredient of existing domain-specific heuristics, e.g., for placing an item that has not been placed yet in bin packing. Therefore, in our novel semantics negation as failure and aggregates in heuristic conditions are evaluated on a partial solver state. State-of-the-art solvers do not allow such a declarative specification. Our implementation in the lazy-grounding ASP system Alpha supports heuristic directives under this semantics. By that, we also provide the first implementation for incorporating declaratively specified domain-specific heuristics in a lazy-grounding setting. Experiments confirm that the combination of ASP solving with lazy grounding and our novel heuristics can be a vital ingredient for solving industrial-size problems.

show abstract

“…Dodaro et alof configuration problems recurring in the practice of Siemens with application in systems of railway interlocking, safety automation, resource distribution, etc. Given their practical importance, PUP and CCP have been the subject of research in the last few years (Falkner et al 2011;Aschinger et al 2011b;Teppan et al 2012;Drescher 2012;Gebser et al 2015c). The solution of these problems using ASP was quite successful from the perspective of modeling.…”

mentioning

confidence: 99%

“…As stated by Gerhard Friedrich in his joint invited talk at CP-ICLP 2015 "domain-specific heuristics turned out to be the key component in several industrial applications of problem solvers" (Friedrich 2015). The first attempts of solving CCP instances by combining domain-heuristics and an off-the-shelf ASP implementation have been very promising (Gebser et al 2015c). Nonetheless, the challenge of solving the hardest real-world instances using ASP remained open (Gebser et al 2015c).In this paper, the combination of ASP and domain-specific heuristics is studied with the goal of providing effective solutions to PUP and CCP.…”

mentioning

confidence: 99%

“…The first attempts of solving CCP instances by combining domain-heuristics and an off-the-shelf ASP implementation have been very promising (Gebser et al 2015c). Nonetheless, the challenge of solving the hardest real-world instances using ASP remained open (Gebser et al 2015c).In this paper, the combination of ASP and domain-specific heuristics is studied with the goal of providing effective solutions to PUP and CCP. Several heuristic criteria are considered, including the ones already proposed, as well as novel ones.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)

Dodaro¹,

Gasteiger²,

Leone³

et al. 2016

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP solvers. Experiments show that the performance of ASP solvers could be significantly improved by embedding domain-specific heuristics, but a proper effective integration of such criteria in off-the-shelf ASP implementations is not obvious. In this paper the combination of ASP and domain-specific heuristics is studied with the goal of effectively solving real-world problem instances of PUP and CCP. As a byproduct of this activity, the ASP solver wasp was extended with an interface that eases embedding new external heuristics in the solver. The evaluation shows that our domain-heuristic-driven ASP solver finds solutions for all the real-world instances of PUP and CCP ever provided by Siemens

show abstract

Combining Heuristics for Configuration Problems Using Answer Set Programming

Cited by 11 publications

References 14 publications

The Sixth Answer Set Programming Competition

The Sixth Answer Set Programming Competition

Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)

Contact Info

Product

Resources

About