| Package | Description |
|---|---|
| net.sf.tweety.arg.deductive | |
| net.sf.tweety.arg.deductive.categorizer |
| Constructor and Description |
|---|
AbstractDeductiveArgumentationReasoner(net.sf.tweety.commons.BeliefBase beliefBase,
Categorizer categorizer,
Accumulator accumulator)
Creates a new reasoner for the given belief base,
categorizer, and accumulator.
|
CompilationReasoner(net.sf.tweety.commons.BeliefBase beliefBase,
Categorizer categorizer,
Accumulator accumulator)
Creates a new compilation reasoner for the given belief base,
categorizer, and accumulator.
|
SimpleReasoner(net.sf.tweety.commons.BeliefBase beliefBase,
Categorizer categorizer,
Accumulator accumulator)
Creates a new reasoner for the given belief base,
categorizer, and accumulator.
|
| 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. |
Copyright © 2018. All rights reserved.