Metraipolis › archive › dc_cd666f2d821c

From Contexts to Values: Context-Dependent Defeat in Abstract Argumentation — arXiv:2608.15536

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15536
License (as archived)
CC0-1.0
Archived
2026-10-18T17:25:01.236Z
SHA-256 of the archived text
72b6116447344d9b8f4539406becbfba6978dccdce49453386e7b4cd1561421c
Stable URL of this page
https://metraipolis.com/documento/dc_cd666f2d821c

How to cite

From Contexts to Values: Context-Dependent Defeat in Abstract Argumentation — arXiv:2608.15536 — arXiv (en), https://arxiv.org/abs/2608.15536 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd666f2d821c (Metraipolis archive dc_cd666f2d821c, sha256 72b6116447344d9b8f4539406becbfba6978dccdce49453386e7b4cd1561421c)
BibTeX
@misc{dccd666f2d821c,
  title = {From Contexts to Values: Context-Dependent Defeat in Abstract Argumentation — arXiv:2608.15536},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15536},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd666f2d821c; sha256 72b6116447344d9b8f4539406becbfba6978dccdce49453386e7b4cd1561421c},
  year = {2026}
}

Archived text

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

In value-based argumentation, an audience's ordering of values decides which attacks succeed as defeats. In many settings the deciding factor is not the audience but the circumstances: the same attack may succeed at one procedural stage, or under one regulation, and fail at another. Context-dependent argumentation frameworks (CDAFs), a model we recently introduced, capture this directly: one attack relation and a defeat function that switches each attack on or off per context, so every context induces an ordinary Dung framework. This raises a reduction question: can one value assignment with per-context orderings reproduce the defeat function, collapsing the CDAF into a VAF? We present a polynomial-time decision procedure for this question and map the harder neighbouring problems, with upper bounds from NP to $\Sigma^p_3$. We also present a validated reference implementation and a measurement: representability is rare and falls fast with the number of contexts.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.15536 — 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-18T16:29:13.808Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).