T - is the type of the language that the ASPIC theory's rules range overpublic class WeakestLinkOrder<T extends Invertable> extends java.lang.Object implements java.util.Comparator<AspicArgument<T>>
| Modifier and Type | Field and Description |
|---|---|
private java.util.Comparator<java.util.Collection<InferenceRule<T>>> |
premset_comp |
private java.util.Comparator<java.util.Collection<InferenceRule<T>>> |
ruleset_comp
Comparators for defeasible rules and ordinary premises
|
| Constructor and Description |
|---|
WeakestLinkOrder(java.util.Comparator<InferenceRule<T>> rule_comp,
java.util.Comparator<InferenceRule<T>> prem_comp,
boolean elitist)
Constructs a new weakest link ordering
|
| Modifier and Type | Method and Description |
|---|---|
int |
compare(AspicArgument<T> a,
AspicArgument<T> b) |
private java.util.Comparator<java.util.Collection<InferenceRule<T extends Invertable>>> ruleset_comp
private java.util.Comparator<java.util.Collection<InferenceRule<T extends Invertable>>> premset_comp
public WeakestLinkOrder(java.util.Comparator<InferenceRule<T>> rule_comp, java.util.Comparator<InferenceRule<T>> prem_comp, boolean elitist)
rule_comp - comparator for defeasible rulesprem_comp - comparator for ordinary premiseselitist - public int compare(AspicArgument<T> a, AspicArgument<T> b)
compare in interface java.util.Comparator<AspicArgument<T extends Invertable>>