Weighted Bipolar Argumentation Graphs: Axioms and Semantics

Abstract

The paper studies how arguments can be evaluated in weighted bipolar argumentation graphs (i.e., graphs whose arguments have basic weights and may be supported and attacked). It introduces principles that an evaluation method (or semantics) would satisfy, analyzes existing semantics with respect to them, and finally proposes a new semantics for the class of non-maximal acyclic graphs.

Cite

Text

Amgoud and Ben-Naim. "Weighted Bipolar Argumentation Graphs: Axioms and Semantics." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/720

Markdown

[Amgoud and Ben-Naim. "Weighted Bipolar Argumentation Graphs: Axioms and Semantics." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/amgoud2018ijcai-weighted/) doi:10.24963/IJCAI.2018/720

BibTeX

@inproceedings{amgoud2018ijcai-weighted,
  title     = {{Weighted Bipolar Argumentation Graphs: Axioms and Semantics}},
  author    = {Amgoud, Leila and Ben-Naim, Jonathan},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {5194-5198},
  doi       = {10.24963/IJCAI.2018/720},
  url       = {https://mlanthology.org/ijcai/2018/amgoud2018ijcai-weighted/}
}