Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Srdjan Vesic"'
Publikováno v:
Argument & Computation, Vol 13, Iss 2, Pp 195-208 (2022)
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil’s Extended Argumentation Frameworks. We demo
Externí odkaz:
https://doaj.org/article/5dc26edd2b52446cbaef7d7350c02559
Autor:
Gabriella Pigozzi, Srdjan Vesic
Publikováno v:
Argument & Computation, Vol 12, Iss 1, Pp 1-2 (2021)
Externí odkaz:
https://doaj.org/article/2450159a89984c5f869cfe29ff8780f5
Publikováno v:
Journal of Logic and Computation. 33:230-256
The issue of how a semantics should deal with self-attacking arguments was always a subject of debate among argumentation scholars. A consensus exists for extension-based semantics because those arguments are always rejected (as soon as the semantics
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability. Many different gradual semantics have been proposed in the literature, each following different principles and producing different argument
Publikováno v:
Logic and Argumentation
4th International Conference on Logic and Argumentation (CLAR 2021)
4th International Conference on Logic and Argumentation (CLAR 2021), Oct 2021, Hangzhou, China. ⟨10.1007/978-3-030-89391-0_8⟩
Lecture Notes in Computer Science ISBN: 9783030893903
CLAR
4th International Conference on Logic and Argumentation (CLAR 2021)
4th International Conference on Logic and Argumentation (CLAR 2021), Oct 2021, Hangzhou, China. ⟨10.1007/978-3-030-89391-0_8⟩
Lecture Notes in Computer Science ISBN: 9783030893903
CLAR
International audience; The issue of how a semantics should deal with self-attacking arguments was always a subject of debate amongst argumentation scholars. A consensus exists for extension-based semantics because those arguments are always rejected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4cd33bdd705cfc078dcc9abd922bf3f
https://hal.archives-ouvertes.fr/hal-03405588
https://hal.archives-ouvertes.fr/hal-03405588
Autor:
Bruno Yun, Srdjan Vesic
Publikováno v:
Symbolic and Quantitative Approaches to Reasoning with Uncertainty
ECSQARU The Sixteenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2021)
ECSQARU The Sixteenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2021), Sep 2021, Prague, Czech Republic. ⟨10.1007/978-3-030-86772-0_15⟩
Lecture Notes in Computer Science ISBN: 9783030867713
ECSQARU
ECSQARU The Sixteenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2021)
ECSQARU The Sixteenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2021), Sep 2021, Prague, Czech Republic. ⟨10.1007/978-3-030-86772-0_15⟩
Lecture Notes in Computer Science ISBN: 9783030867713
ECSQARU
International audience; Gradual semantics are now well-studied in the computational argumentation literature. In this paper, we argue that gradual semantics that can handle both bipolarity (e.g. attacks and supports) and sets of attacking arguments (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de0e6b7dec17bf95a06176bf62c6400c
https://hal-univ-artois.archives-ouvertes.fr/hal-03426757
https://hal-univ-artois.archives-ouvertes.fr/hal-03426757
Autor:
Zied Bouraoui, Srdjan Vesic
This book constitutes the refereed proceedings of the 17th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2023, held in Arras, France, in September 2023. The 35 full papers presented in this volume
Publikováno v:
IJCAI
IJCAI 2020-29th International Joint Conference on Artificial Intelligence
IJCAI 2020-29th International Joint Conference on Artificial Intelligence, Jan 2021, Yokohama / Virtual, Japan. pp.1912-1918, ⟨10.24963/ijcai.2020/265⟩
IJCAI 2020-29th International Joint Conference on Artificial Intelligence
IJCAI 2020-29th International Joint Conference on Artificial Intelligence, Jan 2021, Yokohama / Virtual, Japan. pp.1912-1918, ⟨10.24963/ijcai.2020/265⟩
29th International Joint Conference on Artificial Intelligence and 17th Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}; International audience; Bipolar argumentation studies argumentation graphs where attacks are co
Publikováno v:
arXiv.org
Argument and Computation
Argument and Computation, Taylor & Francis, 2021, pp.1-14. ⟨10.3233/AAC-210007⟩
Argument and Computation
Argument and Computation, Taylor & Francis, 2021, pp.1-14. ⟨10.3233/AAC-210007⟩
International audience; In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil's Extended Argumentati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::469bbb63fd0d677ff65db3770f667cb3
http://arxiv.org/abs/2006.11020
http://arxiv.org/abs/2006.11020
Publikováno v:
AAAI 20-34th AAAI Conference on Artificial Intelligence
AAAI 20-34th AAAI Conference on Artificial Intelligence, Feb 2020, New York, United States. pp.3033-3040, ⟨10.1609/aaai.v34i03.5697⟩
AAAI
AAAI 2020-34th AAAI Conference on Artificial Intelligence
AAAI 2020-34th AAAI Conference on Artificial Intelligence, Feb 2020, New York, United States. pp.3033-3040, ⟨10.1609/aaai.v34i03.5697⟩
AAAI 20-34th AAAI Conference on Artificial Intelligence, Feb 2020, New York, United States. pp.3033-3040, ⟨10.1609/aaai.v34i03.5697⟩
AAAI
AAAI 2020-34th AAAI Conference on Artificial Intelligence
AAAI 2020-34th AAAI Conference on Artificial Intelligence, Feb 2020, New York, United States. pp.3033-3040, ⟨10.1609/aaai.v34i03.5697⟩
International audience; Argumentation is a process of evaluating and comparing sets of arguments. Ranking-based semantics received a lot of attention recently. All of the semantics introduced so far are applicable to binary attack relations. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bd27a7e030cc23e9964e17ec7d80579
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02374712/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02374712/document