class |
AbstractAcceptabilityReasoner |
Ancestor class for reasoners that are tailored towards computing the
set {a | a is credulously/skeptically accepted wrt.
|
class |
AbstractExtensionReasoner |
Ancestor class for all extension-based reasoners.
|
class |
AbstractSatExtensionReasoner |
Uses a provided SAT solver to solve reasoning problems in AAFs.
|
class |
EeeAcceptabilityReasoner |
Implements the EEE approach ("exhaustively enumerate extensions") to
determine the set of acceptable arguments of an AF, cf.
|
class |
IaqAcceptabilityReasoner |
Implements the IAQ approach ("iterative acceptability queries") to
determine the set of acceptable arguments of an AF, cf.
|
class |
NaiveReasoner |
Reasoner for naive extensions.
|
class |
ProboReasoner |
This reasoner makes use of an external executable for solving reasoning problems
in abstract argumentation.
|
class |
QualifiedReasoner |
Reasoner for qualified sigma-semantics.
|
class |
SatCompleteReasoner |
Uses a SAT solver to determine complete extensions.
|
class |
SatStableReasoner |
Uses a SAT solver to determine stable extensions.
|
class |
SccCF2Reasoner |
Reasoner for CF2 extensions using scc-recursiveness.
|
class |
SCF2Reasoner |
Reasoner for SCF2 extensions using scc-recursiveness.
|
class |
SCOOCNaiveReasoner |
reasoner for SCOOC-naive semantics.
|
class |
SeeAcceptabilityReasoner |
Implements the SEE approach ("selective extension enumeration") to
determine the set of credulously acceptable arguments of an AF
wrt.
|
class |
SeemAcceptabilityReasoner |
Implements the SEEM approach ("selective extension enumeration with MaxSAT") to
determine the set of credulously acceptable arguments of an AF
wrt.
|
class |
SemiQualifiedReasoner |
Reasoner for semi-qualified sigma-semantics.
|
class |
SimpleAdmissibleReasoner |
This reasoner for Dung theories performs inference on the admissible extensions.
|
class |
SimpleCompleteReasoner |
This reasoner for Dung theories performs inference on the complete extensions.
|
class |
SimpleConflictFreeReasoner |
This reasoner for Dung theories performs inference on the conflict-free extensions.
|
class |
SimpleGroundedReasoner |
This reasoner for Dung theories performs inference on the grounded extension.
|
class |
SimpleIdealReasoner |
This reasoner for Dung theories performs inference on the ideal extension.
|
class |
SimplePreferredReasoner |
This reasoner for Dung theories performs inference on the preferred extensions.
|
class |
SimpleSccCompleteReasoner |
This reasoner for Dung theories performs inference on the complete extensions.
|
class |
SimpleSemiStableReasoner |
This reasoner for Dung theories performs inference on the semi-stable extensions.
|
class |
SimpleStableReasoner |
This reasoner for Dung theories performs inference on the stable extensions.
|
class |
SimpleStageReasoner |
This reasoner for Dung theories performs inference on the stage extensions.
|
class |
Stage2Reasoner |
Reasoner for Stage2 semantics using scc-recursiveness
definition see:
Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012
|
class |
StratifiedLabelingReasoner |
This class implements a stratified labeling reasoner.
|
class |
WeaklyAdmissibleReasoner |
Reasoner for weak admissibility
the reasoner reduces the number of sets we have to check by computing candidate sets instead of checking all sets.
|