Faceted Answer-Set Navigation

Talk by Christian Al-Rabbaa

Location: APB 3027
Start: 6. September 2018 at 1:00 pm
End: 6. September 2018 at 2:30 pm
Research group: Computational Logic
Research group: Automata Theory
Research group: Knowledge-Based Systems
Event series: KBS Seminar
iCal

Abstract: Even for small logic programs, the number of resulting answer-sets can be tremendous. In such cases, users might be incapable of comprehending the space of answer-sets as a whole nor being able to identify a specific answer-set according to their needs. To overcome this difficulty, we propose a general formal framework that takes an arbitrary logic program as input, and allows for navigating the space of answer-sets in a systematic interactive way analogous to faceted browsing. The navigation is carried out stepwise, where each step narrows down the remaining solutions, eventually arriving at a single one. We formulate two navigation modes, one stringent conflict avoiding, and a “free” mode, where conflicting selections of facets might occur. For the latter mode, we provide efficient algorithms for resolving the conflicts. We provide an implementation of our approach and demonstrate that our framework is able to handle logic programs for which it is currently infeasible to retrieve all answer sets.

This is joint work with Sebastian Rudolph and Lukas Schweizer, to appear in the Proceedings of the 2nd International Joint Conference on Rules and Reasoning, 2018.

More info at: https://iccl.inf.tu-dresden.de/web/Inproceedings3047/en