Search Results for author:
Found 2 papers, 0 papers with code
Automata for Infinite Argumentation Structures
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects.
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
