=Paper=
{{Paper
|id=Vol-3835/invited2
|storemode=property
|title=Navigating ASP Solution Spaces (Invited Talk, Abstract)
|pdfUrl=https://ceur-ws.org/Vol-3835/invited2.pdf
|volume=Vol-3835
|authors=Sarah Alice Gaggl
|dblpUrl=https://dblp.org/rec/conf/nmr/Gaggl24
}}
==Navigating ASP Solution Spaces (Invited Talk, Abstract)==
<pdf width="1500px">https://ceur-ws.org/Vol-3835/invited2.pdf</pdf>
<pre>
                         Navigating ASP Solution Spaces (Invited Talk, Abstract)
                         Sarah Alice Gaggl
                         Institute of Artificial Intelligence, Technische Universität Dresden


                                         Abstract
                                         A wide range of combinatorial search problems can be modelled and solved with Answer Set Programming (ASP). While modern ASP
                                         solvers allow to quickly enumerate solutions, the user faces the problem of dealing with a possibly exponential number of solutions,
                                         which may easily go into millions and beyond. To still be able to reach an understanding of the answer set space, we propose navigation
                                         approaches to reach subspaces that fulfil desirable criteria. With weighted faceted answer set navigation we allow for a quantitative
                                         understanding of the answer set space. Weights can be assigned to atoms depending on how much they restrict the remaining solution
                                         space, either by counting the number of answer sets (resp. supported models) or counting the number of atoms still available to choose.
                                         Then, we show an iterative approach to compute a diverse collection of answer sets that allows to exchange some answer sets to improve
                                         the size and diversity of the whole collection. In contrast to diverse collections, representative answer sets do not require to specify
                                         a diversity measure. We introduce a notion of representativeness based on entropy, and discuss algorithms to collect representative
                                         collections of answer sets. Finally, we will present a visual approach to explore solution spaces and apply it to the domain of abstract
                                         argumentation.




                          22nd International Workshop on Nonmonotonic Reasoning, November 2-4,
                          2024, Hanoi, Vietnam
                          $ sarah.gaggl@tu-dresden.de (S. A. Gaggl)
                          € https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/en
                          (S. A. Gaggl)
                           0000-0003-2425-6089 (S. A. Gaggl)
                                     © 2024 Copyright for this paper by its authors. Use permitted under Creative Commons License
                                     Attribution 4.0 International (CC BY 4.0).



CEUR
                  ceur-ws.org
Workshop      ISSN 1613-0073
Proceedings

</pre>