Decomposing Semantics in Abstract Argumentation.

The paper introduces a general model for the investigation on decomposability in abstract argumentation, i.e. the possibility of determining the labellings prescribed by a semantics based on evaluations of local functions in subframeworks. By exploiting this model, the paper shows the range of decomposable semantics with varying degrees of local information. A constructive procedure for identifying local functions is then devised, encompassing two kinds of local functions, both of them able to enforce decomposability whenever the semantics is decomposable. As an example of application, the decomposability properties of stable, grounded and preferred semantics are analyzed when local information concerning close neighbors is available.

Authors

• Pietro Baroni
• Federico Cerutti
• Massimiliano Giacomin

Keywords

No keywords are indexed for this paper.