Class CounterTransitivityReasoner

java.lang.Object

org.tweetyproject.arg.rankings.reasoner.AbstractRankingReasoner<LatticePartialOrder<Argument, DungTheory>>

org.tweetyproject.arg.rankings.reasoner.CounterTransitivityReasoner

All Implemented Interfaces:

ModelProvider<Argument, DungTheory, LatticePartialOrder<Argument, DungTheory>>, PostulateEvaluatable<Argument>

public class CounterTransitivityReasoner
extends AbstractRankingReasoner<LatticePartialOrder<Argument, DungTheory>>

This class implements the argument ranking approach of [Pu, Luo, Ranking Arguments based on Counter-Transitivity 2017].

Author:

Sebastian Franke

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static enum	CounterTransitivityReasoner.solver	The solver used to determine the ranking of arguments.

Constructor Summary

Constructors

Constructor	Description
CounterTransitivityReasoner(CounterTransitivityReasoner.solver sol, LatticePartialOrder<Argument, DungTheory> rank)	Constructor

Method Summary

Modifier and Type	Method	Description
LatticePartialOrder<Argument, DungTheory>	cardinality(DungTheory af)	orders arguments after the amount of attackers they have.
LatticePartialOrder<Argument, DungTheory>	cardinalityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra)	ranks arguments according to the cardinality function.
LatticePartialOrder<Argument, DungTheory>	getModel(DungTheory bbase)	Returns a single (dedicated) model of the given belief base.
Collection<LatticePartialOrder<Argument, DungTheory>>	getModels(DungTheory bbase)	Returns a characterizing model of the given belief base
LatticePartialOrder<Argument, DungTheory>	gfpCardinality(DungTheory af)	calculates the greatest fix point.
boolean	isInstalled()	natively installed
LatticePartialOrder<Argument, DungTheory>	quality(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra)	ranks arguments according to a given ranking.
LatticePartialOrder<Argument, DungTheory>	qualityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra)	ranks arguments according to the quality function.
LatticePartialOrder<Argument, DungTheory>	simpleDominance(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra)	only ranks two arguments if one is better according to quality and cardinality

Methods inherited from class java.lang.Object

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

Constructor Details

CounterTransitivityReasoner

public CounterTransitivityReasoner(CounterTransitivityReasoner.solver sol,
 LatticePartialOrder<Argument, DungTheory> rank)

Constructor

Parameters:

sol - solver

rank - the rank

Method Details

getModels

public Collection<LatticePartialOrder<Argument, DungTheory>> getModels(DungTheory bbase)

Description copied from interface: ModelProvider

Returns a characterizing model of the given belief base

Parameters:

bbase - some belief base

Returns:

the (selected) models of the belief base

getModel

public LatticePartialOrder<Argument, DungTheory> getModel(DungTheory bbase)

Description copied from interface: ModelProvider

Returns a single (dedicated) model of the given belief base. If the implemented method allows for more than one dedicated model, the selection may be non-deterministic.

Parameters:

bbase - some belief base

Returns:

a selected model of the belief base.

cardinality

public LatticePartialOrder<Argument, DungTheory> cardinality(DungTheory af)

orders arguments after the amount of attackers they have. The less attackers, the higher the rank

Parameters:

af - the af

Returns:

the cardinality

quality

public LatticePartialOrder<Argument, DungTheory> quality(DungTheory af,
 LatticePartialOrder<Argument, DungTheory> ra)

ranks arguments according to a given ranking. It decides the highest ranked attacker of each argument wrt the underlying ranking and then ranks them after their best attacker

Parameters:

af - the af

ra - the ra

Returns:

the quality

qualityFirst

public LatticePartialOrder<Argument, DungTheory> qualityFirst(DungTheory af,
 LatticePartialOrder<Argument, DungTheory> ra)

ranks arguments according to the quality function. If 2 arguments have the same avlue according to quality, the decsision is left to cardinality

Parameters:

af - the af

ra - the ra

Returns:

quality first

cardinalityFirst

public LatticePartialOrder<Argument, DungTheory> cardinalityFirst(DungTheory af,
 LatticePartialOrder<Argument, DungTheory> ra)

ranks arguments according to the cardinality function. If 2 arguments have the same value according to cardinality, the decision is left to quality

Parameters:

af - the af

ra - the ra

Returns:

cardinality first

gfpCardinality

public LatticePartialOrder<Argument, DungTheory> gfpCardinality(DungTheory af)

calculates the greatest fix point. First the quality is computed based on a ranking that only ranks unattacked arguments higher than the rest. Based on this ranking a cardinality first ranking is constructed. Based on this new ranking a quality ranking is constructed. This process is repeated until two consecutive iterations of cardinality first reach the same conclusion

Parameters:

af - the af

Returns:

the gfpcardinality

simpleDominance

public LatticePartialOrder<Argument, DungTheory> simpleDominance(DungTheory af,
 LatticePartialOrder<Argument, DungTheory> ra)

only ranks two arguments if one is better according to quality and cardinality

Parameters:

af - the af

ra - the ra

Returns:

the simple dominance

isInstalled

public boolean isInstalled()

natively installed

Specified by:

isInstalled in class AbstractRankingReasoner<LatticePartialOrder<Argument, DungTheory>>

Returns:

is installed status