Metraipolis › archive › dc_30ba96028470

Optimal Correction Sets for Provable Redress of Contestable Causal Discovery — arXiv:2610.33138

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.33138
License (as archived)
CC0-1.0
Archived
2026-10-27T07:56:27.353Z
SHA-256 of the archived text
f5f64e9de5eed466b9fd56ae224eb89cae79236587aad603e22092cad1781f5d
Stable URL of this page
https://metraipolis.com/documento/dc_30ba96028470

How to cite

Optimal Correction Sets for Provable Redress of Contestable Causal Discovery — arXiv:2610.33138 — arXiv (en), https://arxiv.org/abs/2610.33138 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_30ba96028470 (Metraipolis archive dc_30ba96028470, sha256 f5f64e9de5eed466b9fd56ae224eb89cae79236587aad603e22092cad1781f5d)
BibTeX
@misc{dc30ba96028470,
  title = {Optimal Correction Sets for Provable Redress of Contestable Causal Discovery — arXiv:2610.33138},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.33138},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_30ba96028470; sha256 f5f64e9de5eed466b9fd56ae224eb89cae79236587aad603e22092cad1781f5d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.33138. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Constraint-based causal discovery relies on conditional-independence (CI) tests that may conflict in finite samples, leaving no causal graph that satisfies them all. Causal Assumption-based Argumentation (ABA) makes these tests explicit as defeasible commitments, and offers correspondence guarantees with a subset of them, but its existing repair procedure releases facts heuristically and offers no formal response to a user's contestation of a release. We argue that contestable causal discovery requires an inspectable repair object, a justification for it, and a predictable revision procedure for such contestations. We therefore formulate CI-fact repair as a minimum-cost correction problem and implement it in Answer Set Programming (ASP). Building on Causal ABA, we provide a compact and efficient ASP encoding of causal consistency, with soundness and completeness guarantees, and a two-way projection correspondence between optimal stable models and minimum-cost correction sets. These results establish fidelity to retained facts, subset-minimality and cost optimality of the repair, conflict-based justifications for released facts, and formally guaranteed redress under user contestations. An empirical evaluation supports the formal account: OptABA-PC retains more correct facts, reduces ambiguity in the compatible outputs, and improves graph reconstruction over Causal ABA on common benchmarks.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.33138 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-27T07:55:30.617Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).