no code implementations • 31 Jul 2023 • Jesse Heyninck, Badran Raddaoui, Christian Straßer
In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments.
no code implementations • 13 Sep 2018 • AnneMarie Borg, Christian Straßer
Syntactic criteria have been proposed in the domain of relevance logic and were recently used in argumentation theory under the names of non-interference and crash-resistance.
no code implementations • 21 Sep 2017 • Jesse Heyninck, Christian Straßer, Pere Pardo
This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them.
no code implementations • 24 Mar 2017 • Mathieu Beirlaen, Jesse Heyninck, Christian Straßer
We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments.
1 code implementation • 13 Dec 2016 • AnneMarie Borg, Daniel Frey, Dunja Šešelja, Christian Straßer
In this paper we present an agent-based model (ABM) of scientific inquiry aimed at investigating how different social networks impact the efficiency of scientists in acquiring knowledge.
no code implementations • 1 Jun 2016 • Mathieu Beirlaen, Christian Straßer
We present a general formal argumentation system for dealing with the detachment of conditional obligations.
no code implementations • 1 Apr 2016 • Jesse Heyninck, Christian Straßer
In this paper we make a contribution to the unification of formal models of defeasible reasoning.