Modifier and Type | Class and Description |
---|---|
class |
ClassicalCategorizer
This class implements a simple categorizer that does
an bottom-up marking of the tree; leafs are marked
undefeated and an inner node is marked defeated
if at least one child is marked undefeated and
defeated otherwise.
The method "categorize" returns "1" if the root node is undefeated and "0" if it is defeated. |
class |
HCategorizer
This class implements the h-categorizer from
Philippe Besnard and Anthony Hunter. |
Modifier and Type | Field and Description |
---|---|
private Categorizer |
AbstractDeductiveArgumentationReasoner.categorizer
The categorizer used for reasoning.
|
Constructor and Description |
---|
AbstractDeductiveArgumentationReasoner(Categorizer categorizer,
Accumulator accumulator)
Creates a new reasoner for the given belief base,
categorizer, and accumulator.
|
CompilationReasoner(Categorizer categorizer,
Accumulator accumulator)
Creates a new compilation reasoner for the given belief base,
categorizer, and accumulator.
|
SimpleReasoner(Categorizer categorizer,
Accumulator accumulator)
Creates a new reasoner for the given belief base,
categorizer, and accumulator.
|
Modifier and Type | Class and Description |
---|---|
class |
CredibilityCategorizer
This class implements a credibility-based categorizer that works like
the classical categorizer but dismisses arguments where
the least credible agent which uttered a formula in that argument
is not as least as credible as the least credible agent which uttered
a formula of the parent argument.
|
Modifier and Type | Field and Description |
---|---|
private Categorizer |
ArgumentativeTransformationFunction.categorizer
The categorizer used by this transformation function.
|
Constructor and Description |
---|
ArgumentativeTransformationFunction(Categorizer categorizer,
Accumulator accumulator,
PlBeliefSet beliefSet,
boolean isSkeptical)
Creates a new argumentative transformation function.
|