Sorting Strategies for Interactive Conflict Resolution in ASP
Andre Thevapalan, Gabriele Kern-Isberner

TL;DR
This paper develops strategies for interactive conflict resolution in answer set programming, aiming to efficiently guide users through resolving multiple conflicts with minimal effort using a graphical representation.
Contribution
It introduces new strategies for selecting $\lambda$-extensions to resolve multiple conflicts simultaneously, enhancing the existing framework for maintaining answer set program consistency.
Findings
Graphical representation of conflict connections and solutions.
Strategies for ordering conflict resolution to minimize user effort.
Efficient guidance for users during conflict resolution process.
Abstract
Answer set programs in practice are often subject to change. This can lead to inconsistencies in the modified program due to conflicts between rules which are the results of the derivation of strongly complementary literals. To facilitate the maintenance of consistency in answer set programs, in this paper we continue work on a recently presented framework that implements interactive conflict resolution by extending the bodies of conflicting rules by suitable literals, so-called -extensions. More precisely, we present strategies to choose -extensions that allow for resolving several conflicts at a time in an order that aims at minimizing (cognitive) efforts. In particular, we present a graphical representation of connections between conflicts and their possible solutions. Such a representation can be utilized to efficiently guide the user through the conflict…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
