Double Rectified Linear Unit-based Modular Semantics for Quantitative Bipolar Argumentation Framework

• URL: http://arxiv.org/abs/2605.02551v1
• Date: Mon, 04 May 2026 12:57:55 GMT
• Title: Double Rectified Linear Unit-based Modular Semantics for Quantitative Bipolar Argumentation Framework
• Abstract summary: Quantitative Bipolar Argumentation Frameworks (QBAFs) provide an alternative approach to computing argument acceptability in Bipolar Argumentation Frameworks (BAFs)<n>Each argument is assigned an initial strength, which is then updated to a final strength by considering the influence of both its attackers and supporters.<n>We introduce novel gradual semantics for QBAFs that address these limitations, producing results that align more closely with intuitive expectations.
• Score: 24.736248300856207
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantitative Bipolar Argumentation Frameworks (QBAFs) provide an alternative approach to computing argument acceptability in Bipolar Argumentation Frameworks (BAFs). Each argument is assigned an initial strength, which is then updated to a final strength by considering the influence of both its attackers and supporters. Over the years, several semantics have been proposed to compute argument acceptability in QBAFs, yet they often yield divergent or counterintuitive results, even for simple acyclic cases. We introduce novel gradual semantics for QBAFs that address these limitations, producing results that align more closely with intuitive expectations, while satisfying established rationality postulates from the literature. Furthermore, we study its convergence behavior, proving that it converges not only for acyclic QBAFs but also for broader classes of cyclic frameworks.

Related papers

• Beyond But-for Test: Counterfactual Explanation in Abstract Argumentation via Actual Causality (Extended Version) [5.972254626695083]
  We introduce an intervention-based counterfactual reasoning framework in abstract argumentation.<n>Our method goes beyond the but-for test, thereby correctly identifying causes in argumentation structures such as Preemption and Overdetermination.
  arXiv  Detail & Related papers  (2026-06-30T03:13:02Z)
• Controlling False Discovery in Arbitrarily Structured Hypothesis Spaces via Reproducing Kernels [47.16593717985932]
  We introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone.<n>We provide two decision rules which we prove to control the False Discovery Rate (FDR)<n>We validate our method on two sources: spatial locations derived from high-dimensional real-world datasets, and a differential gene expression task utilizing protein-protein interaction graphs.
  arXiv  Detail & Related papers  (2026-05-17T17:42:56Z)
• Balanced Aggregation: Understanding and Fixing Aggregation Bias in GRPO [70.38763678943648]
  Reinforcement learning with verifiable rewards (RLVR) has become a central paradigm for improving reasoning and code generation in large language models.<n>Standard GRPO uses sequence aggregation, while recent work has advocated token aggregation as a better alternative.<n>We show that these two rules induce different optimization biases; token aggregation introduces sign-length coupling, while sequence aggregation implicitly downweights longer responses.
  arXiv  Detail & Related papers  (2026-04-14T09:48:46Z)
• On the Convergence of Single-Loop Stochastic Bilevel Optimization with Approximate Implicit Differentiation [44.084531611147305]
  We provide a refined convergence analysis of the Single-loop Approximate Implicit Differentiation (SSAID) algorithm.<n>Our result is noteworthy in two aspects: (i) it matches the optimal $mathcalO(-2)$ rate of state-of-the-art multi-loop methods; and (ii) it provides the first explicit, fine-grained characterization of the $$-dependence.
  arXiv  Detail & Related papers  (2026-02-27T03:12:08Z)
• Change in Quantitative Bipolar Argumentation: Sufficient, Necessary, and Counterfactual Explanations [0.0]
  This paper presents a formal approach to explaining change of inference in Quantitative Bipolar Argumentation Frameworks (QBAFs)<n>We trace changes -- which we call strength inconsistencies -- in the partial order over argument strengths that a semantics establishes on some arguments of interest.<n>We identify sufficient, necessary, and counterfactual explanations for strength inconsistencies and show that strength inconsistency explanations exist if and only if an update leads to strength inconsistency.
  arXiv  Detail & Related papers  (2025-09-21T20:26:47Z)
• ArgRAG: Explainable Retrieval Augmented Generation using Quantitative Bipolar Argumentation [37.816652871790474]
  We propose ArgRAG, an explainable, and contestable alternative that replaces black-box reasoning with structured inference.<n>ArgRAG constructs a QBAF from retrieved documents and performs deterministic reasoning under gradual semantics.
  arXiv  Detail & Related papers  (2025-08-26T13:54:51Z)
• On Gradual Semantics for Assumption-Based Argumentation [15.021229450879316]
  In computational argumentation, gradual semantics are fine-grained alternatives to extension-based and labelling-based semantics.<n>We show that our gradual ABA semantics satisfy suitable adaptations of desirable properties, such as balance and monotonicity.
  arXiv  Detail & Related papers  (2025-07-14T09:02:45Z)
• Quantum Rewinding for IOP-Based Succinct Arguments [42.12045681000549]
  We prove that an interactive variant of the BCS transformation is secure in the standard model against quantum adversaries when the vector commitment scheme is collapsing.<n>As a consequence of our results, we obtain standard-model post-quantum secure succinct arguments with the best complexity known.
  arXiv  Detail & Related papers  (2024-11-08T06:33:08Z)
• Cyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mapping [19.799266797193344]
  We present classical semantics for the Bipolar Argumentation Framework (BAF) and the Recursive BAF (Rec-BAF) This is achieved by providing a modular definition of the sets of defeated and acceptable elements for each BAF-based framework. We also characterize, in an elegant and uniform way, the semantics of general BAF and Rec-BAF in terms of logic programming and partial stable model semantics.
  arXiv  Detail & Related papers  (2024-08-14T16:06:16Z)
• CE-QArg: Counterfactual Explanations for Quantitative Bipolar Argumentation Frameworks (Technical Report) [18.505289553533164]
  We propose an iterative algorithm named Counterfactual Explanations for Quantitative bipolar Argumentation frameworks (CE-QArg) CE-QArg can identify valid and cost-effective counterfactual explanations based on two core modules, polarity and priority. We discuss some formal properties of our counterfactual explanations and empirically evaluate CE-QArg on randomly generated QBAFs.
  arXiv  Detail & Related papers  (2024-07-11T13:34:11Z)
• Towards Extremely Fast Bilevel Optimization with Self-governed Convergence Guarantees [42.514612465664605]
  We propose a single-level formulation to uniformly understand existing explicit and implicit Gradient-based BLOs. A striking feature of our convergence result is that, compared to those original unaccelerated GBLO versions, the fast BAGDC admits a unified non-asymptotic convergence theory towards stationarity.
  arXiv  Detail & Related papers  (2022-05-20T09:46:10Z)
• Variational Causal Networks: Approximate Bayesian Inference over Causal Structures [132.74509389517203]
  We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs. In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
  arXiv  Detail & Related papers  (2021-06-14T17:52:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.