On the acceptance of loops in argumentation frameworks

DOI10.1093/LOGCOM/EXU009zbMath1354.68244OpenAlexW2326079481MaRDI QIDQ2957945

Ofer Arieli

Publication date: 31 January 2017

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0c16d62e97dd6c6b5fe69eab558eb7bb6c5e9066

zbMATH Keywords

abstract argumentation4-valued labelingconflict-tolerant semanticsparaconsistent extensions

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (3)

Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation ⋮ I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation

This page was built for publication: On the acceptance of loops in argumentation frameworks