Uses of Interface
net.sf.tweety.commons.QuantitativeReasoner
-
-
Uses of QuantitativeReasoner in net.sf.tweety.arg.deductive.reasoner
Classes in net.sf.tweety.arg.deductive.reasoner that implement QuantitativeReasoner Modifier and Type Class 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
SimpleDeductiveReasoner
This class implements a brute force approach to deductive argumentation. -
Uses of QuantitativeReasoner in net.sf.tweety.arg.prob.reasoner
Classes in net.sf.tweety.arg.prob.reasoner that implement QuantitativeReasoner Modifier and Type Class 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
SimplePafReasoner
This class implements a naive algorithm for computing probabilities of extensions in probabilistic argumentation frameworks from [Li, Oren, Norman. -
Uses of QuantitativeReasoner in net.sf.tweety.arg.social.reasoner
Classes in net.sf.tweety.arg.social.reasoner that implement QuantitativeReasoner Modifier and Type Class 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. -
Uses of QuantitativeReasoner in net.sf.tweety.logics.mln.reasoner
Classes in net.sf.tweety.logics.mln.reasoner that implement QuantitativeReasoner Modifier and Type Class 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
SimpleMlnReasoner
class
SimpleSamplingMlnReasoner
This MLN reasoner employs simple random sampling from the set of interpretations to compute the probability of a formula. -
Uses of QuantitativeReasoner in net.sf.tweety.logics.pcl.reasoner
Classes in net.sf.tweety.logics.pcl.reasoner that implement QuantitativeReasoner Modifier and Type Class 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. -
Uses of QuantitativeReasoner in net.sf.tweety.logics.rpcl.reasoner
Classes in net.sf.tweety.logics.rpcl.reasoner that implement QuantitativeReasoner Modifier and Type Class Description class
RpclMeReasoner
General ME-reasoner for RPCL.
-