Zobrazeno 1 - 10
of 249
pro vyhledávání: '"Wallner, Johannes"'
Autor:
Popescu, Andrei, Wallner, Johannes P.
Reasoning with defeasible and conflicting knowledge in an argumentative form is a key research field in computational argumentation. Reasoning under various forms of uncertainty is both a key feature and a challenging barrier for automated argumentat
Externí odkaz:
http://arxiv.org/abs/2407.05058
Most existing computational tools for assumption-based argumentation (ABA) focus on so-called flat frameworks, disregarding the more general case. In this paper, we study an instantiation-based approach for reasoning in possibly non-flat ABA. We make
Externí odkaz:
http://arxiv.org/abs/2404.11431
Publikováno v:
ACM Transactions on Graphics, Volume 42, Issue 6, Article 183 (December 2023), 13 pages
The property of a surface being developable can be expressed in different equivalent ways, by vanishing Gauss curvature, or by the existence of isometric mappings to planar domains. Computational contributions to this topic range from special paramet
Externí odkaz:
http://arxiv.org/abs/2210.04099
Autor:
Straß, Hannes, Wallner, Johannes Peter
dialectical frameworks (ADFs) have recently been proposed as a versatile generalization of Dung's abstract argumentation frameworks (AFs). In this paper, we present a comprehensive analysis of the computational complexity of ADFs. Our results show th
Externí odkaz:
http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-129614
http://www.qucosa.de/fileadmin/data/qucosa/documents/12961/report2.pdf
http://www.qucosa.de/fileadmin/data/qucosa/documents/12961/report2.pdf
Autor:
Haret, Adrian, Wallner, Johannes P.
We look at preference change arising out of an interaction between two elements: the first is an initial preference ranking encoding a pre-existing attitude; the second element is new preference information signaling input from an authoritative sourc
Externí odkaz:
http://arxiv.org/abs/2112.14243
Autor:
Straß, Hannes, Wallner, Johannes Peter
dialectical frameworks (ADFs) have recently been proposed as a versatile generalization of Dung''s abstract argumentation frameworks (AFs). In this paper, we present a comprehensive analysis of the computational complexity of ADFs. Our results show t
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A12226
https://ul.qucosa.de/api/qucosa%3A12226/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A12226/attachment/ATT-0/
In this solver description we present ASPARTIX-V, in its 2021 edition, which participates in the International Competition on Computational Models of Argumentation (ICCMA) 2021. ASPARTIX-V is capable of solving all classical (static) reasoning tasks
Externí odkaz:
http://arxiv.org/abs/2109.03166
Assumption-based argumentation (ABA) is a central structured argumentation formalism. As shown recently, answer set programming (ASP) enables efficiently solving NP-hard reasoning tasks of ABA in practice, in particular in the commonly studied logic
Externí odkaz:
http://arxiv.org/abs/2108.04192
Autor:
Hüning, Svenja, Wallner, Johannes
This paper provides a strategy to analyse the convergence of nonlinear analogues of linear subdivision processes on the sphere. In contrast to previous work, we study the Riemannian analogue of a linear scheme on a Riemannian manifold with positive s
Externí odkaz:
http://arxiv.org/abs/2001.09426
Autor:
Wallner, Johannes
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations like avera
Externí odkaz:
http://arxiv.org/abs/1907.07550