Package net.sf.tweety.arg.rankings.reasoner

Class MTRankingReasoner

java.lang.Object

net.sf.tweety.arg.rankings.reasoner.AbstractRankingReasoner<NumericalArgumentRanking>

net.sf.tweety.arg.rankings.reasoner.MTRankingReasoner

All Implemented Interfaces:

net.sf.tweety.commons.ModelProvider<net.sf.tweety.arg.dung.syntax.Argument,net.sf.tweety.arg.dung.syntax.DungTheory,NumericalArgumentRanking>, net.sf.tweety.commons.postulates.PostulateEvaluatable<net.sf.tweety.arg.dung.syntax.Argument>

public class MTRankingReasoner
extends AbstractRankingReasoner<NumericalArgumentRanking>

This class implements the argument ranking approach of [Matt, Toni. A game-theoretic measure of argument strength for abstract argumentation. JELIA 2008]. In this approach, the strength of an argument is computed using a two-person zero-sum strategic game in which the strategies of players are sets of arguments.

Author:

Anna Gessler

Constructor Summary

Constructors

Constructor	Description
MTRankingReasoner()

Method Summary

Modifier and Type	Method	Description
double	computeDegreeOfAcceptability(Collection<net.sf.tweety.arg.dung.syntax.Argument> A, Collection<net.sf.tweety.arg.dung.syntax.Argument> B, net.sf.tweety.arg.dung.syntax.DungTheory kb)	Computes the degree of acceptability of the strategy A wrt.
double	computeRewards(Collection<net.sf.tweety.arg.dung.syntax.Argument> A, Collection<net.sf.tweety.arg.dung.syntax.Argument> B, net.sf.tweety.arg.dung.syntax.DungTheory kb)	Computes the rewards of the given strategy (set of arguments).
double	computeStrengthOfArgument(net.sf.tweety.arg.dung.syntax.Argument a, net.sf.tweety.arg.dung.syntax.DungTheory kb, Set<Set<net.sf.tweety.arg.dung.syntax.Argument>> subsets)	Computes the value of the zero-sum game for the given argument.
NumericalArgumentRanking	getModel(net.sf.tweety.arg.dung.syntax.DungTheory kb)
Collection<NumericalArgumentRanking>	getModels(net.sf.tweety.arg.dung.syntax.DungTheory bbase)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MTRankingReasoner

public MTRankingReasoner()

Method Detail

getModels

public Collection<NumericalArgumentRanking> getModels(net.sf.tweety.arg.dung.syntax.DungTheory bbase)

getModel

public NumericalArgumentRanking getModel(net.sf.tweety.arg.dung.syntax.DungTheory kb)

computeStrengthOfArgument

public double computeStrengthOfArgument(net.sf.tweety.arg.dung.syntax.Argument a,
                                        net.sf.tweety.arg.dung.syntax.DungTheory kb,
                                        Set<Set<net.sf.tweety.arg.dung.syntax.Argument>> subsets)

Computes the value of the zero-sum game for the given argument.

Parameters:

a - an Argument

kb - DungTheory

subsets - all subsets of the knowledge base

Returns:

strength value of the given argument

computeRewards

public double computeRewards(Collection<net.sf.tweety.arg.dung.syntax.Argument> A,
                             Collection<net.sf.tweety.arg.dung.syntax.Argument> B,
                             net.sf.tweety.arg.dung.syntax.DungTheory kb)

Computes the rewards of the given strategy (set of arguments).

Parameters:

A - set of arguments

B - set of arguments

kb - knowledge base containing the relations between A and B

Returns:

rewards of A

computeDegreeOfAcceptability

public double computeDegreeOfAcceptability(Collection<net.sf.tweety.arg.dung.syntax.Argument> A,
                                           Collection<net.sf.tweety.arg.dung.syntax.Argument> B,
                                           net.sf.tweety.arg.dung.syntax.DungTheory kb)

Computes the degree of acceptability of the strategy A wrt. strategy B.

Parameters:

A - set of arguments

B - set of arguments

kb - knowledge base containing the relations between A and B

Returns:

degree of acceptability of A wrt. B.