Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Johannes P. Wallner"'
Autor:
Johannes P. Wallner
Publikováno v:
Argument & Computation, Vol 11, Iss 1-2, Pp 151-190 (2020)
Many recent studies of dynamics in formal argumentation within AI focus on the well-known formalism of Dung’s argumentation frameworks (AFs). Despite the usefulness of AFs in many areas of argumentation, their abstract notion of arguments creates a
Externí odkaz:
https://doaj.org/article/f57b05050e4448ee8033c3369f3af8d9
Publikováno v:
Argument & Computation, Vol 9, Iss 1, Pp 41-72 (2018)
Abstract solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way via graphs. Compared to traditional methods like pseudo-code descriptions, abstract solvers have several advantages. In particular, they provide a un
Externí odkaz:
https://doaj.org/article/4088eca9c1cf4875b0de3d09168d11d9
Autor:
Skiba, Kenneth, Thimm, Matthias, Rienstra, Tjitze, Heyninck, J.L.A., Kern-Isberner, Gabriele, Johannes P. Wallner
Publikováno v:
SAFA’22: Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022, 3236, 73-85
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::87d90af23ce7fb7e0796905974216a4f
https://research.ou.nl/en/publications/357e0334-eb45-419e-b2e6-9a3d93e6f400
https://research.ou.nl/en/publications/357e0334-eb45-419e-b2e6-9a3d93e6f400
Assumption-based argumentation (ABA) is one of the most-studied formalisms for structured argumentation. While ABA is a general formalism that can be instantiated with various different logics, most attention from the computational perspective has be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a429bdd5ca4feb618db455d6678d2584
https://doi.org/10.3233/faia220156
https://doi.org/10.3233/faia220156
Autor:
Markus Ulbricht, Johannes P. Wallner
Computational argumentation is primed to strengthen the current hot research field of Explainable Artificial Intelligence (XAI), e.g., by dialectical approaches. In this paper, we extend and discuss a recently proposed approach of so-called strong ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0bc66de1d1cfb3e76e2dd764a186c31
https://doi.org/10.3233/faia220163
https://doi.org/10.3233/faia220163
Publikováno v:
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning.
Rephrasing argumentation semantics in terms of subsets of defeasible elements allows for gaining new insights for reasoning about acceptance in established fragments of the central structured argumentation formalism of ASPIC+. We provide a non-trivia
Autor:
Jan Maly, Johannes P. Wallner
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:6435-6443
Preferences play a key role in computational argumentation in AI, as they reflect various notions of argument strength vital for the representation of argumentation. Within central formal approaches to structured argumentation, preferential approache
dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58793a6668f267f6228f7229f8fac8dc
http://hdl.handle.net/10138/341944
http://hdl.handle.net/10138/341944
Publikováno v:
Logic Programming and Nonmonotonic Reasoning ISBN: 9783031157066
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0d84d8eddebe89506f85dee7f2ccea1
https://doi.org/10.1007/978-3-031-15707-3_14
https://doi.org/10.1007/978-3-031-15707-3_14