Modifier and Type | Class and Description |
---|---|
class |
AbstractDeductiveArgumentationReasoner
This class contains common characteristics for deductive argumentation
reasoner.
|
class |
CompilationReasoner
This class implements the approach of knowledge base compilation as proposed in
Philippe Besnard and Anthony Hunter. |
class |
SimpleReasoner
This class implements a brute force approach to deductive argumentation.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractPafReasoner
Abstract anecestor for PAF reasoner.
|
class |
MonteCarloPafReasoner
This class implements the Monte Carlo algorithm for estimating
probabilities of extensions in probabilistic argumentation frameworks
from [Li, Oren, Norman.
|
class |
NaivePafReasoner
This class implements naive algorithm for computing
probabilities of extensions in probabilistic argumentation frameworks
from [Li, Oren, Norman.
|
Modifier and Type | Class and Description |
---|---|
class |
IssReasoner
This reasoner provides is an implementation of the "Iterative Successive Subsitution Algorithm"
from [Marco Correia and Jorge Cruz and João Leite.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractMlnReasoner
This class provides common methods for MLN reasoner.
|
class |
AlchemyMlnReasoner
This class implements a wrapper for Alchemy in order to
reason with MLNs.
|
class |
ApproximateNaiveMlnReasoner
This reasoner performs approximate reasoning with MLNs by considering
only a subset of all Herbrand interpretations.
|
class |
IteratingMlnReasoner
This MLN reasoner takes another MLN reasoner and performs several iterations
with this one and takes the average result as result.
|
class |
NaiveMlnReasoner |
class |
SimpleSamplingMlnReasoner
This MLN reasoner employs simple random sampling from
the set of interpretations to compute the probability of a formula.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractPclReasoner
Abstract class for all PCL reasoners.
|
class |
DefaultMeReasoner
This class implements a maximum entropy reasoner for probabilistic
conditional logic.
|
class |
GeneralizedMeReasoner
This class implements a generalized maximum entropy reasoner for probabilistic
conditional logic as proposed in [Potyka, Thimm, 2014] which also works for
inconsistent belief sets.
|
Modifier and Type | Class and Description |
---|---|
class |
RpclMeReasoner
General ME-reasoner for RPCL.
|