Back to AI Research

AI Research

Splitting Argumentation Frameworks with Collective... | AI Research

Key Takeaways

  • This research introduces new techniques for "splitting" complex argumentation frameworks, specifically those that include both collective attacks and support...
  • This work proposes novel splitting techniques for argumentation formalisms that incorporate supports between defeasible elements.
  • Notably, BSAFs establish a crucial link to structured argumentation as they naturally capture general (potentially non-flat) assumption-based argumentation.
  • The increase in expressiveness calls for diverse forms of splitting.
  • We consider splits over collective attacks (thereby generalizing the recently proposed splitting techniques for SETAFs), splits over collective supports, as well as splits over both collective attacks and supports.
Paper AbstractExpand

This work proposes novel splitting techniques for argumentation formalisms that incorporate supports between defeasible elements. We base our studies on bipolar set-based argumentation frameworks (BSAFs) which generalize argumentation frameworks with collective attacks (SETAFs), as well as bipolar argumentation frameworks (BAFs), by incorporating both collective attacks and supports. Notably, BSAFs establish a crucial link to structured argumentation as they naturally capture general (potentially non-flat) assumption-based argumentation. The increase in expressiveness calls for diverse forms of splitting. We consider splits over collective attacks (thereby generalizing the recently proposed splitting techniques for SETAFs), splits over collective supports, as well as splits over both collective attacks and supports. We establish suitable splitting schemata and prove their correctness for the most common argumentation semantics.

This research introduces new techniques for "splitting" complex argumentation frameworks, specifically those that include both collective attacks and support relations. Argumentation frameworks are used in AI to model debates and reach rational conclusions, but they often become computationally difficult to solve as they grow in size. By breaking these frameworks down into smaller, manageable pieces, researchers can compute results more efficiently. This paper focuses on Bipolar Set-Based Argumentation Frameworks (BSAFs), which are highly expressive models that can represent complex, rule-based reasoning.

Addressing Complexity Through Decomposition

The core challenge in abstract argumentation is that the number of possible "extensions"—or sets of jointly acceptable arguments—can grow exponentially with the size of the framework. Splitting is a technique that decomposes a large framework into smaller sub-frameworks. These sub-frameworks are solved independently, and their results are then combined to determine the overall extensions of the original system. While this has been successful for simpler models, the addition of support relations (where arguments reinforce one another) creates new technical hurdles that this paper aims to resolve.

Splitting Attacks and Supports

The authors propose a systematic approach to splitting that accounts for the unique interactions in BSAFs. They investigate three distinct ways to cut a framework:

  • Splitting over collective attacks: Extending existing methods for frameworks that only feature attacks, the authors adapt the process to ensure that the "reduct" (the simplified sub-framework) correctly accounts for how arguments are rejected or accepted.

  • Splitting over collective supports: This involves defining new rules to handle how support relations influence the acceptance of arguments across the split.

  • Unified splitting: The researchers combine these methods into a single pipeline that allows for arbitrary cuts across both attack and support relations.

Key Findings and Limitations

The paper provides formal proofs demonstrating that these splitting techniques are correct for most standard argumentation semantics. However, the research highlights important limitations:

  • Grounded Semantics: The splitting procedure only works partially under grounded semantics, meaning it may not be universally applicable in every scenario.

  • Preferred Semantics: When using preferred semantics, the splitting procedure is selective, meaning it identifies only a subset of the possible extensions rather than the full set.

  • Indirect Effects: The authors discovered that the presence of support relations can cause information to be "lost" during the splitting process. Specifically, a negative link might appear undecided in a sub-framework but actually be defeated by support relations elsewhere. To address this, the authors emphasize the need to process negative links carefully to ensure that the information encoded in support relations remains explicit throughout the computation.

Comments (0)

No comments yet

Be the first to share your thoughts!