| Package | Description | 
|---|---|
| net.sf.tweety.arg.aspic | |
| net.sf.tweety.arg.aspic.order | |
| net.sf.tweety.arg.aspic.syntax | 
| Modifier and Type | Field and Description | 
|---|---|
private java.util.Collection<InferenceRule<T>> | 
AspicArgumentationTheory.rules
The inference rules this system's arguments will be created from,
 correesponds to an argumentation theory (AS, KB) with
                - AS argumentation system = rules with premises (p -> c)
                - KB knowledge base = rules without premises (-> c) 
 | 
| Modifier and Type | Method and Description | 
|---|---|
java.util.Collection<InferenceRule<T>> | 
AspicArgumentationTheory.getRules()  | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
AspicArgumentationTheory.addRule(InferenceRule<T> rule)
Adds an additional inference rule 
 | 
| Modifier and Type | Field and Description | 
|---|---|
private java.util.Comparator<java.util.Collection<InferenceRule<T>>> | 
WeakestLinkOrder.premset_comp  | 
private java.util.Comparator<java.util.Collection<InferenceRule<T>>> | 
LastLinkOrder.premset_comp  | 
(package private) java.util.Comparator<InferenceRule<T>> | 
SimpleAspicOrder.rule_comp  | 
private java.util.Comparator<java.util.Collection<InferenceRule<T>>> | 
WeakestLinkOrder.ruleset_comp
Comparators for defeasible rules and ordinary premises 
 | 
private java.util.Comparator<java.util.Collection<InferenceRule<T>>> | 
LastLinkOrder.ruleset_comp
Comparators for defeasible rules and ordinary premises 
 | 
| Modifier and Type | Method and Description | 
|---|---|
int | 
RuleComparator.compare(InferenceRule<T> o1,
       InferenceRule<T> o2)  | 
int | 
RuleComparator.compare(InferenceRule<T> o1,
       InferenceRule<T> o2)  | 
| Constructor and Description | 
|---|
LastLinkOrder(java.util.Comparator<InferenceRule<T>> rule_comp,
             java.util.Comparator<InferenceRule<T>> prem_comp,
             boolean elitist)
Constructs a new last link ordering 
 | 
LastLinkOrder(java.util.Comparator<InferenceRule<T>> rule_comp,
             java.util.Comparator<InferenceRule<T>> prem_comp,
             boolean elitist)
Constructs a new last link ordering 
 | 
WeakestLinkOrder(java.util.Comparator<InferenceRule<T>> rule_comp,
                java.util.Comparator<InferenceRule<T>> prem_comp,
                boolean elitist)
Constructs a new weakest link ordering 
 | 
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 | Class and Description | 
|---|---|
class  | 
DefeasibleInferenceRule<T extends Invertable>  | 
class  | 
StrictInferenceRule<T extends Invertable>  | 
| Modifier and Type | Field and Description | 
|---|---|
private InferenceRule<T> | 
AspicArgument.toprule
The srgument's top rule 
 | 
| Modifier and Type | Method and Description | 
|---|---|
InferenceRule<T> | 
AspicArgument.getTopRule()
Retruns the TopRule according to ASPIC+ specification 
 | 
| Modifier and Type | Method and Description | 
|---|---|
java.util.Collection<InferenceRule<T>> | 
AspicArgument.getDefeasibleRules()
Returns the DefRules according to ASPIC+ specification,
 i.e. 
 | 
java.util.Collection<InferenceRule<T>> | 
AspicArgument.getListLastDefeasibleRules()
Returns all defeasible subrules of the level where the first defeasible subrule appears,
 i.e. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
AspicArgument.setTopRule(InferenceRule<T> toprule)
Changes the TopRule 
 | 
| Constructor and Description | 
|---|
AspicArgument(InferenceRule<T> toprule)
Creates an empty Argument 
 | 
| Constructor and Description | 
|---|
AspicArgument(DigraphNode<InferenceRule<T>> node,
             java.util.Collection<AspicArgument<T>> as)
Creates an new argument with and all of its subarguments and adds them to as 
 |