Navigating ASP Solution Spaces: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
(Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Navigating ASP Solution Spaces |Beschreibung EN=Abstract: A wide range of combinatorial search problems can be modelled and solved wi…“)
 
Keine Bearbeitungszusammenfassung
 
Zeile 1: Zeile 1:
{{Veranstaltung
{{Veranstaltung
|Titel EN=Navigating ASP Solution Spaces
|Titel EN=Investigating the finite-cliquewidth-model property of C².
|Beschreibung EN=Abstract: A wide range of combinatorial search problems can be modelled and solved with Answer Set Programming (ASP). While modern ASP solvers
|Beschreibung EN=Abstract: I will try to explain to you the results of my internship on 2-variable logics (with counters) and how it interfaces with the cliquewidth notion.  
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.
We start with 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. Then, we will discuss the concept of weighted faceted answer set navigation, which allows 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.
Finally, we will present a visual approach to explore solution spaces and apply it to the domain of abstract argumentation.  


The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
Zeile 17: Zeile 9:
|Ende=2023/07/06 12:00:00
|Ende=2023/07/06 12:00:00
|Raum=APB room 3027
|Raum=APB room 3027
|Vortragender=Sarah Gaggl
|Vortragender=Vincent Peth
|Event series=Research Seminar Logic and AI
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
|In News anzeigen=1
}}
}}

Aktuelle Version vom 6. Juli 2023, 09:32 Uhr

Investigating the finite-cliquewidth-model property of C².

Vortrag von Vincent Peth
Abstract: I will try to explain to you the results of my internship on 2-variable logics (with counters) and how it interfaces with the cliquewidth notion.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:

https://bbb.tu-dresden.de/b/pio-zwt-smp-aus