Package org.tweetyproject.arg.aspic.order

Class WeakestLinkOrder<T extends Invertable>

java.lang.Object

org.tweetyproject.arg.aspic.order.WeakestLinkOrder<T>

Type Parameters:

T - is the type of the language that the ASPIC theory's rules range over

All Implemented Interfaces:

Comparator<AspicArgument<T>>

public class WeakestLinkOrder<T extends Invertable>
extends Object
implements Comparator<AspicArgument<T>>

Author:

Nils Geilen A comparator for Aspic Arguments, that compares all deafeasible rules

Constructor Summary

Constructors

Constructor	Description
WeakestLinkOrder(Comparator<InferenceRule<T>> rule_comp, Comparator<InferenceRule<T>> prem_comp, boolean elitist)	Constructs a new weakest link ordering

Method Summary

Modifier and Type	Method	Description
int	compare(AspicArgument<T> a, AspicArgument<T> b)

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Comparator

equals, reversed, thenComparing, thenComparing, thenComparing, thenComparingDouble, thenComparingInt, thenComparingLong

Constructor Details

WeakestLinkOrder

public WeakestLinkOrder(Comparator<InferenceRule<T>> rule_comp,
 Comparator<InferenceRule<T>> prem_comp,
 boolean elitist)

Constructs a new weakest link ordering

Parameters:

rule_comp - comparator for defeasible rules

prem_comp - comparator for ordinary premises

elitist - some boolean

Method Details

compare

public int compare(AspicArgument<T> a,
 AspicArgument<T> b)

Specified by:

compare in interface Comparator<T extends Invertable>