Representative Answer Sets: Collecting Something of Everything

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Representative Answer Sets: Collecting Something of Everything

Vortrag von Elisa Böhl
Title: Representative Answer Sets: Collecting Something of Everything

Abstract: Answer set programming (ASP) is a popular problem solving paradigm with applications in planning and configuration. In practice, the number of answer sets can be overwhelmingly high, which naturally causes interest in a concise characterisation of the solution space in terms of representative answer sets. We establish a notion of representativeness that refers to the entropy of specified target atoms within a collection of answer sets. Accordingly, we pro- pose different approaches for collecting such representative answer sets, based on answer set navigation. Finally, we conduct experi- ments using our prototypical implementation, which reveals promis- ing results.

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