Modifier and Type | Class and Description |
---|---|
class |
FlatABAReasoner |
class |
GeneralABAReasoner<T extends Formula> |
class |
WellFoundedReasoner<T extends Formula> |
Modifier and Type | Class and Description |
---|---|
class |
AspicReasoner |
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 |
DelpReasoner
This reasoner performs default dialectical reasoning
on some given DeLP.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractExtensionReasoner
This class models an abstract extension reasoner used for Dung theories.
|
class |
AdmissibleReasoner
This reasoner for Dung theories performs inference on the admissible extensions.
|
class |
CF2Reasoner
This reasoner for Dung theories performs inference on the CF2 extensions.
|
class |
CompleteReasoner
This reasoner for Dung theories performs inference on the complete extensions.
|
class |
ConflictFreeReasoner
This reasoner for Dung theories performs inference on the conflict-free extensions.
|
class |
GrossiModgilRankingReasoner
This class implements the argument ranking approach of
[Grossi, Modgil.
|
class |
GroundReasoner
This reasoner for Dung theories performs inference on the grounded extension.
|
class |
IdealReasoner
This reasoner for Dung theories performs inference on the ideal extension.
|
class |
PreferredReasoner
This reasoner for Dung theories performs inference on the preferred extensions.
|
class |
SccCompleteReasoner
This reasoner for Dung theories performs inference on the complete extensions.
|
class |
SemiStableReasoner
This reasoner for Dung theories performs inference on the semi-stable extensions.
|
class |
StableReasoner
This reasoner for Dung theories performs inference on the stable extensions.
|
class |
StageReasoner
This reasoner for Dung theories performs inference on the stage extensions.
|
class |
StratifiedLabelingReasoner
This class implements a stratified labeling reasoner.
|
Modifier and Type | Class and Description |
---|---|
class |
ArgumentationReasoner
This class models a reasoner for extended logic programming based arguments using
the fixpoint semantics from [1] parameterised by a notion of attack x for the opponent
and another notion of attack y as a defense for the proponent.
|
class |
LiteralReasoner
This class extends the default argumentation reasoner to the reasoning
about literals in the set of arguments constructible from an extended logic program p.
|
Modifier and Type | Class and Description |
---|---|
class |
MonteCarloPafReasoner
This class implements the Monte Carlo algorithm for estimating
probabilities of extensions in probabilistic argumentation frameworks
from [Li, Oren, Norman.
|
Modifier and Type | Class and Description |
---|---|
class |
DeductiveArgMeReasoner
This class implements the ME-reasoning approach from [Hunter, Thimm, 2013, in preparation].
|
Modifier and Type | Class and Description |
---|---|
class |
OutputReasoner
This class models an abstract reasoner for structured argumentation frameworks.
|
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 |
BruteForceCReasoner
This class models a brute force c-reasoner for conditional logic.
|
class |
CReasoner
This class models a c-reasoner for conditional logic.
|
class |
RelevanceReasoner
Implements the approach from
James P. |
class |
RuleBasedCReasoner
This is a reasoner using c-representation and rules to solve these c-representations.
|
class |
ZReasoner
This class models a z-reasoner for conditional logic.
|
Modifier and Type | Class and Description |
---|---|
class |
ClassicalInference
This class implements the classical inference operator.
|
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 | Method and Description |
---|---|
double |
AggregatingCoherenceMeasure.coherence(MarkovLogicNetwork mln,
Reasoner reasoner,
FolSignature signature) |
abstract double |
AbstractCoherenceMeasure.coherence(MarkovLogicNetwork mln,
Reasoner reasoner,
FolSignature signature)
Measures the coherence of the given MLN using the given reasoner.
|
double |
DefaultCompatibilityMeasure.compatibility(java.util.List<MarkovLogicNetwork> mlns,
Reasoner reasoner,
java.util.List<FolSignature> signatures) |
double |
CompatibilityMeasure.compatibility(java.util.List<MarkovLogicNetwork> mlns,
Reasoner reasoner,
java.util.List<FolSignature> signatures)
Measures the compatibility of the given MLNs wrt.
|
Modifier and Type | Class and Description |
---|---|
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 |
NaiveReasoner
Naive classical inference (checks all interpretations for satisfiability).
|
class |
SatReasoner
Uses the default SAT reasoner to perform reasoning in propositional logic
|
Modifier and Type | Class and Description |
---|---|
class |
RelationalBruteForceCReasoner
This class models a relational brute force c-reasoner for relational conditional logic.
|
Modifier and Type | Class and Description |
---|---|
class |
NaiveDefaultReasoner
Implements a naive reasoner for default logic based on exhaustive
application of defaults in process trees.
|
Modifier and Type | Class and Description |
---|---|
class |
RpclMeReasoner
General ME-reasoner for RPCL.
|