T
- is the type of the language that the ABA theory's rules range overpublic class Deduction<T extends Formula> extends Argument
Modifier and Type | Field and Description |
---|---|
(package private) ABARule<T> |
rule |
(package private) java.util.Collection<Deduction<T>> |
subs |
Constructor and Description |
---|
Deduction(java.lang.String name)
Constructs a new deduction
|
Deduction(java.lang.String name,
ABARule<T> rule,
java.util.Collection<Deduction<T>> subs)
Constructs a new deduction
|
Modifier and Type | Method and Description |
---|---|
void |
addSubDeduction(Deduction<T> sub)
Adds a subdeduction
|
boolean |
equals(java.lang.Object obj) |
java.util.Collection<T> |
getAssumptions() |
T |
getConclusion() |
ABARule<T> |
getRule() |
java.util.Collection<ABARule<T>> |
getRules() |
int |
hashCode() |
void |
setRule(ABARule<T> rule) |
java.lang.String |
toString() |
getLdoArgument, getLdoFormula, getName, getSignature, setName
public Deduction(java.lang.String name)
name
- an identifierpublic T getConclusion()
public java.util.Collection<T> getAssumptions()
public void addSubDeduction(Deduction<T> sub)
sub
- a deductionpublic java.util.Collection<ABARule<T>> getRules()