Uses of Interface
net.sf.tweety.commons.QualitativeReasoner
-
-
-
Uses of QualitativeReasoner in net.sf.tweety.arg.aba.reasoner
Classes in net.sf.tweety.arg.aba.reasoner that implement QualitativeReasoner 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 QualitativeReasoner in net.sf.tweety.arg.aspic.reasoner
Classes in net.sf.tweety.arg.aspic.reasoner that implement QualitativeReasoner Modifier and Type Class Description class
AbstractAspicReasoner<T extends Invertable>
The abstract ancestor of all Aspic reasoner implementationsclass
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 QualitativeReasoner in net.sf.tweety.arg.dung.reasoner
Classes in net.sf.tweety.arg.dung.reasoner that implement QualitativeReasoner 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
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
IaqAcceptabilityReasoner
Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.class
NaiveReasoner
Reasoner for naive extensions.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
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 credulously 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
SimpleAdmissibleReasoner
This reasoner for Dung theories performs inference on the admissible 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
Stage2Reasoner
Reasoner for Stage2 semantics using scc-recursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012class
StratifiedLabelingReasoner
This class implements a stratified labeling reasoner.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. -
Uses of QualitativeReasoner in net.sf.tweety.arg.lp.reasoner
Classes in net.sf.tweety.arg.lp.reasoner that implement QualitativeReasoner 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 QualitativeReasoner in net.sf.tweety.arg.saf.reasoner
Classes in net.sf.tweety.arg.saf.reasoner that implement QualitativeReasoner Modifier and Type Class Description class
OutputReasoner
This class models an abstract reasoner for structured argumentation frameworks. -
Uses of QualitativeReasoner in net.sf.tweety.logics.cl.reasoner
Classes in net.sf.tweety.logics.cl.reasoner that implement QualitativeReasoner 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 QualitativeReasoner in net.sf.tweety.logics.dl.reasoner
Classes in net.sf.tweety.logics.dl.reasoner that implement QualitativeReasoner Modifier and Type Class Description class
NaiveDlReasoner
Naive reasoner for the description logic ALC (as represented by this library). -
Uses of QualitativeReasoner in net.sf.tweety.logics.fol.reasoner
Classes in net.sf.tweety.logics.fol.reasoner that implement QualitativeReasoner 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 solversclass
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 QualitativeReasoner in net.sf.tweety.logics.ml.reasoner
Classes in net.sf.tweety.logics.ml.reasoner that implement QualitativeReasoner 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 QualitativeReasoner in net.sf.tweety.logics.pl.reasoner
Classes in net.sf.tweety.logics.pl.reasoner that implement QualitativeReasoner 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 logicclass
SimplePlReasoner
Naive classical inference (checks all interpretations for satisfiability). -
Uses of QualitativeReasoner in net.sf.tweety.logics.qbf.reasoner
Classes in net.sf.tweety.logics.qbf.reasoner that implement QualitativeReasoner Modifier and Type Class Description class
NaiveQbfReasoner
Naive classical inference for quantified boolean formulas (checks all interpretations for satisfiability). -
Uses of QualitativeReasoner in net.sf.tweety.logics.rcl.reasoner
Classes in net.sf.tweety.logics.rcl.reasoner that implement QualitativeReasoner Modifier and Type Class Description class
SimpleRelationalCReasoner
This class models a relational brute force c-reasoner for relational conditional logic. -
Uses of QualitativeReasoner in net.sf.tweety.logics.rdl.reasoner
Classes in net.sf.tweety.logics.rdl.reasoner that implement QualitativeReasoner 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 QualitativeReasoner in net.sf.tweety.lp.asp.reasoner
Classes in net.sf.tweety.lp.asp.reasoner that implement QualitativeReasoner 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.
-