TY  - GEN
A1  - Gebser, Martin
A1  - Kaminski, Roland
A1  - Schaub, Torsten H.
T1  - Complex optimization in answer set programming
T2  - Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
N2  - Preference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems do not offer complex optimization capacities, supporting, for instance, inclusion-based minimization or Pareto efficiency. Rather, such complex criteria are typically addressed by resorting to dedicated modeling techniques, like saturation. Unlike the ease of common ASP modeling, however, these techniques are rather involved and hardly usable by ASP laymen. We address this problem by developing a general implementation technique by means of meta-prpogramming, thus reusing existing ASP systems to capture various forms of qualitative preferences among answer sets. In this way, complex preferences and optimization capacities become readily available for ASP applications.
T3  - Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 554 
KW  - answer set programming
KW  - preference handling
KW  - complex optimization
KW  - meta-programming
Y1  - 2019
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/41243
UR  - https://nbn-resolving.org/urn:nbn:de:kobv:517-opus4-412436
SN  - 1866-8372
IS  - 554
ER  -