Search Results for author:
Found 8 papers, 0 papers with code
Ranking-based Argumentation Semantics Applied to Logical Argumentation (full version)
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.
Argumentative Characterizations of (Extended) Disjunctive Logic Programs
This paper continues an established line of research about the relations between argumentation theory, particularly assumption-based argumentation, and different kinds of logic programs.
Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics.
Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of nonmonotonic logics.
On Nested Justification Systems (full version)
Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential.
Assumption-Based Approaches to Reasoning with Priorities
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.
Reasoning by Cases in Structured Argumentation
We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments.
Relations between assumption-based approaches in nonmonotonic logic and formal argumentation
In this paper we make a contribution to the unification of formal models of defeasible reasoning.
