Uses of Interface
org.tweetyproject.commons.Reasoner

Packages that use Reasoner

Package	Description
org.tweetyproject.arg.aba.reasoner
org.tweetyproject.arg.aspic.reasoner
org.tweetyproject.arg.deductive.reasoner
org.tweetyproject.arg.delp.reasoner
org.tweetyproject.arg.dung.reasoner
org.tweetyproject.arg.dung.reasoner.serialisable
org.tweetyproject.arg.extended.reasoner
org.tweetyproject.arg.lp.reasoner
org.tweetyproject.arg.prob.reasoner
org.tweetyproject.arg.saf.reasoner
org.tweetyproject.arg.setaf.reasoners
org.tweetyproject.arg.social.reasoner
org.tweetyproject.commons
org.tweetyproject.logics.cl.reasoner
org.tweetyproject.logics.dl.reasoner
org.tweetyproject.logics.fol.reasoner
org.tweetyproject.logics.ml.reasoner
org.tweetyproject.logics.mln.reasoner
org.tweetyproject.logics.pcl.reasoner
org.tweetyproject.logics.pl.reasoner
org.tweetyproject.logics.qbf.reasoner
org.tweetyproject.logics.rcl.reasoner
org.tweetyproject.logics.rdl.reasoner
org.tweetyproject.logics.rpcl.reasoner
org.tweetyproject.lp.asp.reasoner

Uses of Reasoner in org.tweetyproject.arg.aba.reasoner

Classes in org.tweetyproject.arg.aba.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	CompleteReasoner<T extends Formula>	This reasoner for ABA theories performs inference on the complete extensions.
class	FlatAbaReasoner<T extends Formula>	This class models a reasoner over ABA formulae.
class	GeneralAbaReasoner<T extends Formula>	This is an abstract generalization over non-flat ABA reasoners.
class	IdealReasoner<T extends Formula>	This reasoner for ABA theories performs inference on the ideal extension.
class	PreferredReasoner<T extends Formula>	This reasoner for ABA theories performs inference on the preferred extensions.
class	StableReasoner<T extends Formula>	This reasoner for ABA theories performs inference on the stable extensions.
class	WellFoundedReasoner<T extends Formula>	This reasoner for ABA theories performs inference on the ideal extension.

Uses of Reasoner in org.tweetyproject.arg.aspic.reasoner

Classes in org.tweetyproject.arg.aspic.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	AbstractAspicReasoner<T extends Invertable>	The abstract ancestor of all Aspic reasoner implementations
class	DirectionalAspicReasoner<T extends Invertable>	Computes a restricted AF by only considering relevant arguments to a query.
class	ModuleBasedAspicReasoner<T extends Invertable>	Slightly optimised reasoner for ASPIC.
class	RandomAspicReasoner<T extends Invertable>	This class implements an approximate reasoner for ASPIC+ that randomly samples arguments.
class	SimpleAspicReasoner<T extends Invertable>

Uses of Reasoner in org.tweetyproject.arg.deductive.reasoner

Classes in org.tweetyproject.arg.deductive.reasoner that implement Reasoner

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 Reasoner in org.tweetyproject.arg.delp.reasoner

Classes in org.tweetyproject.arg.delp.reasoner that implement Reasoner

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

Uses of Reasoner in org.tweetyproject.arg.dung.reasoner

Subinterfaces of Reasoner in org.tweetyproject.arg.dung.reasoner

Modifier and Type	Interface	Description
interface	KOptimisationReasoner	Interface for reasoner capable of optimising k extensions.

Classes in org.tweetyproject.arg.dung.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	AbstractAcceptabilityReasoner	Ancestor class for reasoners that are tailored towards computing the set {a | a is credulously/skeptically accepted wrt.
class	AbstractClaimBasedReasoner	Ancestor class for all claim based reasoner.
class	AbstractDungReasoner	Ancestor class for all AAF reasoners.
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	FudgeAcceptabilityReasoner	Implements the Fudge approach to determine the set of acceptable arguments of an AF wrt.
class	GCF_GreedyKApproximationReasoner	Starting from the empty set, this algorithms greedily determines an approximation to a k-stable extension by iteratively adding arguments (without introducing conflicts) that add the maximal number of arguments to the range.
class	GFR_GreedyKApproximationReasoner	Starting from the empty set, this algorithms greedily determines an approximation to a k-stable* extension by iteratively adding arguments that add the maximal number of arguments to the range, until full range is achieved.
class	IaqAcceptabilityReasoner	Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.
class	MaxSatKStableAstReasoner	A MaxSAT-based implementation for solving the MaxStable* problem from [Thimm.
class	MaxSatKStableReasoner	A MaxSAT-based implementation for solving the MaxStable problem from [Thimm.
class	ProboI23Reasoner	This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
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	SCF_GreedyKApproximationReasoner	Starting from the complete set of arguments, this algorithms greedily determines an approximation to a k-stable extension by iteratively removing arguments (that resolve a maximal number of conflicts) until the set is conflict-free.
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 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	SFR_GreedyKApproximationReasoner	Starting from the complete set of arguments, this algorithms greedily determines an approximation to a k-stable* extension by iteratively removing arguments (without losing full range) that remove the maximal number of conflicts.
class	SimpleAdmissibleReasoner	This reasoner for Dung theories performs inference on the admissible extensions.
class	SimpleClInheritedReasoner	calculates claim based inherited extensions
class	SimpleClNaiveReasoner	calculates claim based naive extensions
class	SimpleClPreferredReaonser	calculates claim based preferred reasoner
class	SimpleClSemistableReasoner	a simple claimbased semi stable reasoner
class	SimpleClStableReasoner	a claim based stable reaonser
class	SimpleClStagedReasoner	calculates claim based staged 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	SimpleEagerReasoner	simple reasoner for eager semantics
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	SimpleInitialReasoner	Basic Implementation of a reasoner for initial sets A set of arguments S is considered initial iff it is non-empty and minimal among the non-empty admissible sets Ref: Yuming Xu and Claudette Cayrol.
class	SimpleNaiveReasoner	Reasoner for naive extensions.
class	SimplePreferredReasoner	This reasoner for Dung theories performs inference on the preferred extensions.
class	SimpleResolutionBasedReasoner	This reasoner for Dung theories performs inference on the resolution-based family of semantics.
class	SimpleSccCompleteReasoner	This reasoner for Dung theories performs inference on the complete extensions.
class	SimpleSccRecursiveReasoner	Universal scc-recursive reasoner initialize with any reasoner for a scc-recursive semantics
class	SimpleSemiStableReasoner	This reasoner calculates claim based 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	SolidAdmissibleReasoner	Reasoner for solid admissibility a set of arguments E solid-defends an argument a, iff for all attackers b of a it holds that all arguments c which attack b are in E see: Liu, X., and Chen, W.
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	StronglyAdmissibleReasoner	Reasoner for strong admissibility
class	StronglyUndisputedReasoner	Implements the strongly undisputed semantics, as proposed in [Thimm.
class	UndisputedReasoner	Implements the undisputed semantics, as proposed in [Thimm.
class	VacuousReductReasoner	Implements a general vacuous reduct reasoner, as proposed in [Thimm.
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.
class	WeaklyCompleteReasoner	Reasoner for weakly complete semantics as described in: see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.
class	WeaklyGroundedReasoner	Reasoner for weakly grounded semantics a set of arguments E is w-grounded iff it is w-complete and minimal Note: unlike the grounded extension which is unique, there can be more than one w-grounded extension see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.
class	WeaklyPreferredReasoner	Reasoner for weakly preferred semantics see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.

Uses of Reasoner in org.tweetyproject.arg.dung.reasoner.serialisable

Classes in org.tweetyproject.arg.dung.reasoner.serialisable that implement Reasoner

Modifier and Type	Class	Description
class	SerialisableExtensionReasoner	Ancestor class for serialisable AF reasoners
class	SerialisedAdmissibleReasoner	Serialised version of the admissible semantics
class	SerialisedCompleteReasoner	Serialised version of the complete semantics
class	SerialisedGroundedReasoner	Serialised version of the grounded semantics
class	SerialisedPreferredReasoner	Serialised version of the preferred semantics
class	SerialisedStableReasoner	Serialised version of the stable semantics
class	SerialisedStronglyAdmissibleReasoner	This class represents a reasoner to compute the extensions of the strongly admissible Semantics by serialising unattacked initial sets.
class	SerialisedUnchallengedReasoner	Serialised reasoner for the unchallenged semantics The unchallenged semantics amounts to exhaustively adding unattacked and unchallenged initial sets

Uses of Reasoner in org.tweetyproject.arg.extended.reasoner

Classes in org.tweetyproject.arg.extended.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	AbstractExtendedExtensionReasoner	Abstract extension reasoner for reasoning with extended theories
class	FlattenBasedExtendedExtensionReasoner	General reasoner for extended theories that computes extended by flattening and then computing the AF extensions
class	SimpleExtendedAdmissibleReasoner	Simple reasoner for computing admissible sets of extended theories.
class	SimpleExtendedCompleteReasoner	Simple reasoner for computing complete extensions of extended theories.
class	SimpleExtendedConflictFreeReasoner	Simple reasoner for computing conflict-free sets of extended theories.

Uses of Reasoner in org.tweetyproject.arg.lp.reasoner

Classes in org.tweetyproject.arg.lp.reasoner that implement Reasoner

Modifier and Type	Class	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 org.tweetyproject.arg.prob.reasoner

Classes in org.tweetyproject.arg.prob.reasoner that implement Reasoner

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 Reasoner in org.tweetyproject.arg.saf.reasoner

Classes in org.tweetyproject.arg.saf.reasoner that implement Reasoner

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

Uses of Reasoner in org.tweetyproject.arg.setaf.reasoners

Classes in org.tweetyproject.arg.setaf.reasoners that implement Reasoner

Modifier and Type	Class	Description
class	AbstractExtensionSetAfReasoner	Ancestor class for all SetAf-extension-based reasoners.
class	AbstractSetAfReasoner	Ancestor class for all Setaf reasoners.
class	SimpleAdmissibleSetAfReasoner	This reasoner for SetAf theories performs inference on the admissible extensions.
class	SimpleCompleteSetAfReasoner	This reasoner for SetAf theories performs inference on the complete extensions.
class	SimpleConflictFreeSetAfReasoner	This reasoner for SetAf theories performs inference on the conflict-free extensions.
class	SimpleEagerSetAfReasoner	simple reasoner for eager semantics
class	SimpleGroundedSetAfReasoner	This reasoner for SetAf theories performs inference on the grounded extension.
class	SimpleIdealSetAfReasoner	This reasoner for setAf theories performs inference on the ideal extension.
class	SimplePreferredSetAfReasoner	This reasoner for setaf theories performs inference on the preferred extensions.
class	SimpleSemiStableSetAfReasoner	This reasoner for setaf theories performs inference on the semi-stable extensions.
class	SimpleStableSetAfReasoner	This reasoner for setaf theories performs inference on the stable extensions.
class	SimpleStageSetAfReasoner	This reasoner for setaf theories performs inference on the stage extensions.

Uses of Reasoner in org.tweetyproject.arg.social.reasoner

Classes in org.tweetyproject.arg.social.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	IssReasoner	This reasoner provides is an implementation of the "Iterative Successive Substitution Algorithm" from [Marco Correia and Jorge Cruz and João Leite.

Uses of Reasoner in org.tweetyproject.commons

Subinterfaces of Reasoner in org.tweetyproject.commons

Modifier and Type	Interface	Description
interface	QualitativeReasoner<B extends BeliefBase,F extends Formula>	This interface represents a general contract for qualitative reasoners, which are objects that can query a belief base with a specific formula and return a boolean result (`TRUE` or `FALSE`) based on the reasoning process.
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 org.tweetyproject.logics.cl.reasoner

Classes in org.tweetyproject.logics.cl.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	AbstractConditionalLogicReasoner	Abstract ancestor for all 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	SimpleCReasoner	This class models a brute force c-reasoner for conditional logic.
class	ZReasoner	This class models a z-reasoner for conditional logic.

Uses of Reasoner in org.tweetyproject.logics.dl.reasoner

Classes in org.tweetyproject.logics.dl.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	NaiveDlReasoner	Naive reasoner for the description logic ALC.

Uses of Reasoner in org.tweetyproject.logics.fol.reasoner

Classes in org.tweetyproject.logics.fol.reasoner that implement Reasoner

Modifier and Type	Class	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	Prover9FolReasoner	Invokes Prover9 ( https://www.cs.unm.edu/~mccune/mace4/), an automated theorem prover for first-order logic, and returns its results.
class	SimpleFolReasoner	Uses a naive brute force search procedure for theorem proving.
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 org.tweetyproject.logics.ml.reasoner

Classes in org.tweetyproject.logics.ml.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	AbstractMlReasoner	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	SimpleMlReasoner	This class implements inference for modal logic using a brute-force approach.
class	SPASSMlReasoner	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 org.tweetyproject.logics.mln.reasoner

Classes in org.tweetyproject.logics.mln.reasoner that implement Reasoner

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	This class implements a simple reasoner for MLNs.
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 org.tweetyproject.logics.pcl.reasoner

Classes in org.tweetyproject.logics.pcl.reasoner that implement Reasoner

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 Reasoner in org.tweetyproject.logics.pl.reasoner

Classes in org.tweetyproject.logics.pl.reasoner that implement Reasoner

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

Uses of Reasoner in org.tweetyproject.logics.qbf.reasoner

Classes in org.tweetyproject.logics.qbf.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	NaiveQbfReasoner	Naive classical inference for quantified boolean formulas (checks all interpretations for satisfiability).

Uses of Reasoner in org.tweetyproject.logics.rcl.reasoner

Classes in org.tweetyproject.logics.rcl.reasoner that implement Reasoner

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

Uses of Reasoner in org.tweetyproject.logics.rdl.reasoner

Classes in org.tweetyproject.logics.rdl.reasoner that implement Reasoner

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

Uses of Reasoner in org.tweetyproject.logics.rpcl.reasoner

Classes in org.tweetyproject.logics.rpcl.reasoner that implement Reasoner

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

Uses of Reasoner in org.tweetyproject.lp.asp.reasoner

Classes in org.tweetyproject.lp.asp.reasoner that implement Reasoner

Modifier and Type	Class	Description
class	ASPSolver	This class provides a common interface for asp solvers.
class	ClingoSolver	Invokes Clingo (Part of the Potassco project), an ASP system that grounds and solves logic programs, and returns computed answer sets.
class	DLVSolver	Wrapper class for the DLV answer set solver command line utility.