Metraipolis › archive › dc_650154e23488

When Stable and Preferred Semantics Agree: A Path-Based Approach — arXiv:2610.30176

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.30176
License (as archived)
CC0-1.0
Archived
2026-10-23T15:12:47.440Z
SHA-256 of the archived text
46d09e61772d9a3424656bd3cb895c387f2094c84667c83fca2c6ba4233065b1
Stable URL of this page
https://metraipolis.com/documento/dc_650154e23488

How to cite

When Stable and Preferred Semantics Agree: A Path-Based Approach — arXiv:2610.30176 — arXiv (en), https://arxiv.org/abs/2610.30176 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_650154e23488 (Metraipolis archive dc_650154e23488, sha256 46d09e61772d9a3424656bd3cb895c387f2094c84667c83fca2c6ba4233065b1)
BibTeX
@misc{dc650154e23488,
  title = {When Stable and Preferred Semantics Agree: A Path-Based Approach — arXiv:2610.30176},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.30176},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_650154e23488; sha256 46d09e61772d9a3424656bd3cb895c387f2094c84667c83fca2c6ba4233065b1},
  year = {2026}
}

Archived text

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

We investigate structural conditions under which preferred and stable semantics agree in abstract argumentation frameworks. Our approach is based on suitably chosen sets of paths in the attack graph and binary relations induced by them. We establish a general path-based criterion for semantic agreement and instantiate it with several classes of paths, obtaining sufficient conditions expressed in terms of well-foundedness of the corresponding relations. The resulting conditions strictly generalize two principal structural criteria for preferred and stable agreement in the literature: Dung's limited controversiality condition and the SCC-symmetry condition. In particular, Dung's result is recovered as a special case by taking the relevant path set to be the set of even paths. We further introduce two infinite sequences of path sets, each yielding a family of agreement conditions. For the first sequence, a Collapse Theorem reduces the infinitely many associated well-foundedness conditions to three essentially distinct ones, whereas the second sequence gives rise to genuinely distinct conditions with no analogous collapse. Our results apply to both finite and infinite argumentation frameworks, admit simplified formulations in the finite case, and also yield sufficient conditions for the existence of stable extensions.

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.30176 — 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-23T15:09:08.352Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).