Uses of Interface
net.sf.tweety.commons.Reasoner

Packages that use Reasoner

Package	Description
net.sf.tweety.arg.aba.reasoner
net.sf.tweety.arg.aspic.reasoner
net.sf.tweety.arg.deductive.reasoner
net.sf.tweety.arg.delp.reasoner
net.sf.tweety.arg.dung.reasoner
net.sf.tweety.arg.lp.reasoner
net.sf.tweety.arg.prob.reasoner
net.sf.tweety.arg.saf.reasoner
net.sf.tweety.arg.social.reasoner
net.sf.tweety.commons
net.sf.tweety.logics.cl.reasoner
net.sf.tweety.logics.fol.reasoner
net.sf.tweety.logics.ml.reasoner
net.sf.tweety.logics.mln.reasoner
net.sf.tweety.logics.pcl.reasoner
net.sf.tweety.logics.pl.reasoner
net.sf.tweety.logics.rcl.reasoner
net.sf.tweety.logics.rdl.reasoner
net.sf.tweety.logics.rpcl.reasoner

Uses of Reasoner in net.sf.tweety.arg.aba.reasoner

Classes in net.sf.tweety.arg.aba.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	CompleteReasoner<T extends Formula>
class	FlatABAReasoner<T extends Formula>
class	GeneralABAReasoner<T extends Formula>
class	IdealReasoner<T extends Formula>
class	PreferredReasoner<T extends Formula>
class	StableReasoner<T extends Formula>
class	WellFoundedReasoner<T extends Formula>

Uses of Reasoner in net.sf.tweety.arg.aspic.reasoner

Classes in net.sf.tweety.arg.aspic.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	AbstractAspicReasoner<T extends Invertable> The abstract ancestor of all Aspic reasoner implementations
class	ModuleBasedAspicReasoner<T extends Invertable> Slightly optimised reasoner for ASPIC.
class	NaiveAspicReasoner<T extends Invertable>
class	RandomAspicReasoner<T extends Invertable> This class implements an approximate reasoner for ASPIC+ that randomly samples arguments.

Uses of Reasoner in net.sf.tweety.arg.deductive.reasoner

Classes in net.sf.tweety.arg.deductive.reasoner that implement Reasoner

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.

Uses of Reasoner in net.sf.tweety.arg.delp.reasoner

Classes in net.sf.tweety.arg.delp.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	DelpReasoner This reasoner performs default dialectical reasoning on some given DeLP.

Uses of Reasoner in net.sf.tweety.arg.dung.reasoner

Classes in net.sf.tweety.arg.dung.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	AbstractDungReasoner Ancestor class for all AAF reasoner.
class	AbstractExtensionReasoner Ancestor class for all extension-based reasoners.
class	AbstractSatExtensionReasoner Uses a provided SAT solver to solve reasoning problems in AAFs.
class	GrossiModgilRankingReasoner This class implements the argument ranking approach of [Grossi, Modgil.
class	ProboReasoner This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
class	SatCompleteReasoner Uses a SAT solver to determine complete extensions.
class	SatStableReasoner Uses a SAT solver to determine stable extensions.
class	SimpleAdmissibleReasoner This reasoner for Dung theories performs inference on the admissible extensions.
class	SimpleCF2Reasoner This reasoner for Dung theories performs inference on the CF2 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	StratifiedLabelingReasoner This class implements a stratified labeling reasoner.

Uses of Reasoner in net.sf.tweety.arg.lp.reasoner

Classes in net.sf.tweety.arg.lp.reasoner that implement 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.

Uses of Reasoner in net.sf.tweety.arg.prob.reasoner

Classes in net.sf.tweety.arg.prob.reasoner that implement Reasoner

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.

Uses of Reasoner in net.sf.tweety.arg.saf.reasoner

Classes in net.sf.tweety.arg.saf.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	OutputReasoner This class models an abstract reasoner for structured argumentation frameworks.

Uses of Reasoner in net.sf.tweety.arg.social.reasoner

Classes in net.sf.tweety.arg.social.reasoner that implement Reasoner

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.

Uses of Reasoner in net.sf.tweety.commons

Subinterfaces of Reasoner in net.sf.tweety.commons

Modifier and Type	Interface and Description
interface	QualitativeReasoner<B extends BeliefBase,F extends Formula> The general interface for objects that are able to query a belief base with some formula and return either TRUE or FALSE as answer.
interface	QuantitativeReasoner<B extends BeliefBase,F extends Formula> The general interface for objects that are able to query a belief base with some formula and return a degree (double value) of its acceptability.

Uses of Reasoner in net.sf.tweety.logics.cl.reasoner

Classes in net.sf.tweety.logics.cl.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	AbstractConditionalLogicReasoner Abstract ancestor for all reasoner for conditional logic.
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	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.

Uses of Reasoner in net.sf.tweety.logics.fol.reasoner

Classes in net.sf.tweety.logics.fol.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	EFOLReasoner Invokes E (http://eprover.org), an automated theorem prover for first-order logic, and returns its results.
class	FolReasoner Abstract FOL Prover to be implemented by concrete solvers
class	NaiveFolReasoner Uses a naive brute force search procedure for theorem proving.
class	Prover9FolReasoner Invokes Prover9 ( https://www.cs.unm.edu/~mccune/mace4/), an automated theorem prover for first-order logic, and returns its results.
class	SpassFolReasoner Invokes SPASS (http://www.mpi-inf.mpg.de/departments/automation-of-logic/software/spass-workbench/), an automated theorem prover for first-order logic, modal logic and description logics.

Uses of Reasoner in net.sf.tweety.logics.ml.reasoner

Classes in net.sf.tweety.logics.ml.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	AbstractModalReasoner Abstract modal reasoner to be implemented by concrete reasoners.
class	MleanCoPReasoner Invokes MleanCoP (http://www.leancop.de/mleancop/), a compact automated theorem prover for modal first-order logic based on the clausal connection calculus.
class	NaiveModalReasoner This class implements inference for modal logic using a brute-force approach.
class	SPASSModalReasoner Invokes SPASS (http://www.mpi-inf.mpg.de/departments/automation-of-logic/software/spass-workbench/), an automated theorem prover for first-order logic, modal logic and description logics.

Uses of Reasoner in net.sf.tweety.logics.mln.reasoner

Classes in net.sf.tweety.logics.mln.reasoner that implement Reasoner

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.

Uses of Reasoner in net.sf.tweety.logics.pcl.reasoner

Classes in net.sf.tweety.logics.pcl.reasoner that implement Reasoner

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.

Uses of Reasoner in net.sf.tweety.logics.pl.reasoner

Classes in net.sf.tweety.logics.pl.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	AbstractPropositionalLogicReasoner Abstract class for propositional logic reasoners.
class	NaiveReasoner Naive classical inference (checks all interpretations for satisfiability).
class	SatReasoner Uses the default SAT reasoner to perform reasoning in propositional logic

Uses of Reasoner in net.sf.tweety.logics.rcl.reasoner

Classes in net.sf.tweety.logics.rcl.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	RelationalBruteForceCReasoner This class models a relational brute force c-reasoner for relational conditional logic.

Uses of Reasoner in net.sf.tweety.logics.rdl.reasoner

Classes in net.sf.tweety.logics.rdl.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	NaiveDefaultReasoner Implements a naive reasoner for default logic based on exhaustive application of defaults in process trees.

Uses of Reasoner in net.sf.tweety.logics.rpcl.reasoner

Classes in net.sf.tweety.logics.rpcl.reasoner that implement Reasoner

Modifier and Type	Class and Description
class	RpclMeReasoner General ME-reasoner for RPCL.