• search hit 2 of 10
Back to Result List

Complex optimization in answer set programming

  • 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.

Download full text files

  • SHA-1: 90bf0a7b5cd38c6abcde8dd992d7046c96f24848

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Martin GebserORCiD, Roland Kaminski, Torsten SchaubORCiDGND
URN:urn:nbn:de:kobv:517-opus4-412436
DOI:https://doi.org/10.25932/publishup-41243
ISSN:1866-8372
Parent Title (English):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
Series (Serial Number):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe (554)
Document Type:Postprint
Language:English
Date of first Publication:2019/01/29
Year of Completion:2011
Publishing Institution:Universität Potsdam
Release Date:2019/01/29
Tag:answer set programming; complex optimization; meta-programming; preference handling
Issue:554
Pagenumber:19
Source:Theory and Practice of Logic Programming 11 (2011) 4–5, pp. 821–839 DOI 10.1017/S1471068411000329
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Peer Review:Referiert
Publication Way:Open Access
Grantor:Cambridge University Press (CUP)
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht
Notes extern:Bibliographieeintrag der Originalveröffentlichung/Quelle