Complexity of verification and existence problems in epistemic argumentation framework

G Alfano, S Greco, D Mandaglio, F Parisi… - ECAI 2023, 2023 - ebooks.iospress.nl
Abstract Dung's Argumentation Framework (AF) has been extended in several directions. An
interesting extension, among others, is the Epistemic AF (EAF) which allows representing …

Yes, no, maybe, I don't know: Complexity and application of abstract argumentation with incomplete knowledge

JG Mailly - Argument & Computation, 2022 - content.iospress.com
Abstract argumentation, as originally defined by Dung, is a model that allows the description
of certain information about arguments and relationships between them: in an abstract …

[HTML][HTML] Taking into account “who said what” in abstract argumentation: Complexity results

B Fazzinga, S Flesca, F Furfaro - Artificial Intelligence, 2023 - Elsevier
We propose a new paradigm for reasoning over abstract argumentation frameworks where
the “who said what” relation, associating each argument with the set of agents who claimed …

The possible winner with uncertain weights problem

D Baumeister, M Neveling, M Roos, J Rothe… - Journal of Computer and …, 2023 - Elsevier
The original possible winner problem consists of an unweighted election with partial
preferences and a distinguished candidate c and asks whether the preferences can be …

The possible winner problem with uncertain weights revisited

M Neveling, J Rothe, R Weishaupt - Fundamentals of Computation Theory …, 2021 - Springer
Abstract Baumeister et al.[8] introduced the possible winner with uncertain weights problem
which, given a weighted election with the weights of some voters as yet unspecified, asks …

Justification, stability and relevance in incomplete argumentation frameworks

D Odekerken, AM Borg, F Bex - Argument & Computation, 2023 - content.iospress.com
We explore the computational complexity of justification, stability and relevance in
incomplete argumentation frameworks (IAFs). IAFs are abstract argumentation frameworks …

[PDF][PDF] On the Verification and Existence Problems in Epistemic Argumentation Framework.

G Alfano, S Greco, D Mandaglio, F Parisi, I Trubitsyna - AI³@ AI* IA, 2023 - ceur-ws.org
Abstract Dung's Argumentation Framework (AF) has been extended in several directions. An
interesting extension, among others, is the Epistemic Argumentation Framework (EAF) …

[PDF][PDF] Deciding the Uncertain: Axiomatic Aspects of Fair Division and Computational Complexity Studies in Computational Social Choice and Graph Theory

R Weishaupt - 2022 - docserv.uni-duesseldorf.de
In this work we study uncertainty across four different areas of theoretical computer science.
For three of the four areas, we analyze the hardness of new and existing problems with tools …

Guest editorial argumentation-based reasoning

F Parisi, GI Simari - IEEE Intelligent Systems, 2021 - ieeexplore.ieee.org
The papers in this special section focus on augmentation-based reasoning. Real-world
knowledge-based systems must deal with information coming from different sources, leading …