Výsledky vyhledávání

Report

Automata for Infinite Argumentation Structures

Autor: Baroni, Pietro, Cerutti, Federico, Dunne, Paul E., Giacomin, Massimiliano

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. To address this limitation,

Externí odkaz: http://arxiv.org/abs/1810.04892

Zobrazit plný text záznamu

Report

Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach

Autor: Cerutti, Federico, Dunne, Paul E., Giacomin, Massimiliano, Vallati, Mauro

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. The approach is based on the idea of reducing the problem

Externí odkaz: http://arxiv.org/abs/1310.4986

Zobrazit plný text záznamu

Akademický článek

Decidability in argumentation semantics.

Autor: Dunne, Paul E.

Publikováno v: Argument & Computation; 2024, Vol. 15 Issue 2, p191-204, 14p

Zobrazit plný text záznamu

Report

On Concise Encodings of Preferred Extensions

Autor: Dunne, Paul E.

Much work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (under the usual assumptions) computationally demanding. We consider appro

Externí odkaz: http://arxiv.org/abs/cs/0207024

Zobrazit plný text záznamu