26 citations · 55 across the 4 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2018★ 26 cited
Automata for Infinite Argumentation Structures
Pietro Baroni, Federico Cerutti, Paul E. Dunne +1
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…
cs.AI2013★ 12 cited
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach
Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin +1
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 pe…
cs.AI2002★ 4 cited
On Concise Encodings of Preferred Extensions
Paul E. Dunne
Much work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (und…