A Semantical Approach to Abstraction in Answer Set Programming and Assumption-Based Argumentation

Iosif Apostolakis, Zeynep G. Saribatur, Johannes Peter Wallner

Abstract: Recently forms of abstraction have been proposed for both logic programs (LPs) under the answer set semantics (ASP) and for the related formalism of assumption-based argumentation (ABA), e.g., via clustering of atoms or assumptions, in order to simplify a given LP or ABA framework. In both approaches after clustering the original answer sets and assumption sets are over-approximated, with the aim of avoiding spuriousness. In contrast, in ASP a given LP is syntactically modified to achieve over-approximation, while on ABA the framework is minimally modified and the semantics is abstracted. In this work we follow the latter approach and provide a novel semantical abstraction for LPs and for ABA frameworks corresponding to LPs.