Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework

arXiv cs.AI / 4/28/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces QACD (Quantitative Argumentation for Causal Discovery), a semantics-driven approach that treats conditional-independence (CI) test results as graded, defeasible arguments rather than brittle hard constraints.
  • QACD converts statistical test outcomes into argument strengths and aggregates conflicting evidence using connectivity-mediated witness propagation to compute a fixed-point acceptability labeling over candidate edges.
  • Experiments on benchmark Bayesian networks indicate QACD improves structural coherence and interventional reliability under noisy or inconsistent CI decision scenarios.
  • The method remains competitive with multiple established approaches, including classical constraint-based, hybrid, and prior argumentation-based baselines, while aiming to reduce error-cascade effects in finite samples.

Abstract

Constraint-based causal discovery is brittle in finite-sample regimes because erroneous conditional-independence (CI) decisions can cascade into substantial structural errors. We propose Quantitative Argumentation for Causal Discovery (QACD), a semantics-driven framework that represents CI outcomes as graded, defeasible arguments rather than irreversible constraints. QACD maps statistical test outcomes to argument strengths and aggregates conflicting evidence through connectivity-mediated witness propagation, producing a fixed-point acceptability labeling over candidate adjacencies. Experiments on standard benchmark Bayesian networks suggest that QACD improves structural coherence and interventional reliability in several noisy or inconsistent CI regimes, while remaining competitive with classical constraint-based, hybrid, and prior argumentation-based baselines.

Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework | AI Navigate