Author name cluster

Dorian Gaertner

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers

1 author row

IS Journal 2007 Journal Article

Computing Arguments and Attacks in Assumption-Based Argumentation

Dorian Gaertner
Francesca Toni

Most computational frameworks for argumentation are based on abstract argumentation, which determines an argument's acceptability on the basis of its ability to counterattack all arguments attacking it. However, this view of argumentation doesn't address how to find arguments, identify attacks, and exploit premises. Assumption-based argumentation addresses these three issues. It's a refinement of abstract argumentation but remains general purpose, nonetheless. Rather than considering arguments to be a primitive concept, assumption-based argumentation defines them as backward deductions (using sets of rules in an underlying logic) supported by sets of assumptions. This approach reduces the notion of an attack against an argument to that of deduction of a contrary of an assumption.

Details DOI

AAMAS Conference 2007 Conference Paper

Distributed Norm Management in Regulated Multi-Agent Systems

Dorian Gaertner
Andres Garcia-Camino
Pablo Noriega
J. -A. Rodriguez-Aguilar
Wamberto Vasconcelos

Norms are widely recognised as a means of coordinating multi-agent systems. The distributed management of norms is a challenging issue and we observe a lack of truly distributed computational realisations of normative models. In order to regulate the behaviour of autonomous agents that take part in multiple, related activities, we propose a normative model, the Normative Structure (NS), an artifact that is based on the propagation of normative positions (obligations, prohibitions, permissions), as consequences of agents' actions. Within a NS, conflicts may arise due to the dynamic nature of the MAS and the concurrency of agents' actions. However, ensuring conflict-freedom of a NS at design time is computationally intractable. We show this by formalising the notion of conflict, providing a mapping of NSs into Coloured Petri Nets and borrowing well-known theoretical results from that field. Since online conflict resolution is required, we present a tractable algorithm to be employed distributedly. We then demonstrate that this algorithm is paramount for the distributed enactment of a NS.

PDF