T
- is the type of the language that the ASPIC theory's rules range overpublic class StrictInferenceRule<T extends Invertable> extends InferenceRule<T>
InferenceRule
Constructor and Description |
---|
StrictInferenceRule()
Constructs an empty instance
|
StrictInferenceRule(T conclusion,
java.util.Collection<T> premise)
Constructs a strict inference rule p -> c
|
Modifier and Type | Method and Description |
---|---|
boolean |
isDefeasible() |
addPremise, addPremises, equals, getConclusion, getIdentifier, getName, getPremise, getSignature, hashCode, isConstraint, isFact, setConclusion, setName, toDefeasible, toStrict, toString
public boolean isDefeasible()
isDefeasible
in class InferenceRule<T extends Invertable>