Uses of Interface
net.sf.tweety.commons.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 Description classCompleteReasoner<T extends Formula>classFlatABAReasoner<T extends Formula>classGeneralABAReasoner<T extends Formula>classIdealReasoner<T extends Formula>classPreferredReasoner<T extends Formula>classStableReasoner<T extends Formula>classWellFoundedReasoner<T extends Formula> -
Uses of Reasoner in net.sf.tweety.arg.adf.reasoner
Classes in net.sf.tweety.arg.adf.reasoner that implement Reasoner Modifier and Type Class Description classAbstractDialecticalFrameworkReasonerAncestor class for all adf reasoner TODO: may be replaced with an interface with default implementationsclassAdmissibleInterpretationReasonerclassNaiveInterpretationReasonerclassSatModelReasoner -
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 Description classAbstractAspicReasoner<T extends Invertable>The abstract ancestor of all Aspic reasoner implementationsclassDirectionalAspicReasoner<T extends Invertable>Computes a restricted AF by only considering relevant arguments to a query.classModuleBasedAspicReasoner<T extends Invertable>Slightly optimised reasoner for ASPIC.classRandomAspicReasoner<T extends Invertable>This class implements an approximate reasoner for ASPIC+ that randomly samples arguments.classSimpleAspicReasoner<T extends Invertable> -
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 Description classAbstractDeductiveArgumentationReasonerThis class contains common characteristics for deductive argumentation reasoner.classCompilationReasonerThis class implements the approach of knowledge base compilation as proposed in
Philippe Besnard and Anthony Hunter.classSimpleDeductiveReasonerThis 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 Description classDelpReasonerThis 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 Description classAbstractDungReasonerAncestor class for all AAF reasoners.classAbstractExtensionReasonerAncestor class for all extension-based reasoners.classAbstractSatExtensionReasonerUses a provided SAT solver to solve reasoning problems in AAFs.classProboReasonerThis reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.classSatCompleteReasonerUses a SAT solver to determine complete extensions.classSatStableReasonerUses a SAT solver to determine stable extensions.classSimpleAdmissibleReasonerThis reasoner for Dung theories performs inference on the admissible extensions.classSimpleCF2ReasonerThis reasoner for Dung theories performs inference on the CF2 extensions.classSimpleCompleteReasonerThis reasoner for Dung theories performs inference on the complete extensions.classSimpleConflictFreeReasonerThis reasoner for Dung theories performs inference on the conflict-free extensions.classSimpleGroundedReasonerThis reasoner for Dung theories performs inference on the grounded extension.classSimpleIdealReasonerThis reasoner for Dung theories performs inference on the ideal extension.classSimplePreferredReasonerThis reasoner for Dung theories performs inference on the preferred extensions.classSimpleSccCompleteReasonerThis reasoner for Dung theories performs inference on the complete extensions.classSimpleSemiStableReasonerThis reasoner for Dung theories performs inference on the semi-stable extensions.classSimpleStableReasonerThis reasoner for Dung theories performs inference on the stable extensions.classSimpleStageReasonerThis reasoner for Dung theories performs inference on the stage extensions.classStratifiedLabelingReasonerThis 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 Description classArgumentationReasonerThis 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.classLiteralReasonerThis 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 Description classAbstractPafReasonerAbstract anecestor for PAF reasoner.classMonteCarloPafReasonerThis class implements the Monte Carlo algorithm for estimating probabilities of extensions in probabilistic argumentation frameworks from [Li, Oren, Norman.classSimplePafReasonerThis class implements a 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 Description classOutputReasonerThis 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 Description classIssReasonerThis 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 Description interfaceQualitativeReasoner<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.interfaceQuantitativeReasoner<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 Description classAbstractConditionalLogicReasonerAbstract ancestor for all reasoner for conditional logic.classCReasonerThis class models a c-reasoner for conditional logic.classRuleBasedCReasonerThis is a reasoner using c-representation and rules to solve these c-representations.classSimpleCReasonerThis class models a brute force c-reasoner for conditional logic.classZReasonerThis class models a z-reasoner for conditional logic. -
Uses of Reasoner in net.sf.tweety.logics.dl.reasoner
Classes in net.sf.tweety.logics.dl.reasoner that implement Reasoner Modifier and Type Class Description classNaiveDlReasonerNaive reasoner for the description logic ALC (as represented by this library). -
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 Description classEFOLReasonerInvokes E (http://eprover.org), an automated theorem prover for first-order logic, and returns its results.classFolReasonerAbstract FOL Prover to be implemented by concrete solversclassProver9FolReasonerInvokes Prover9 ( https://www.cs.unm.edu/~mccune/mace4/), an automated theorem prover for first-order logic, and returns its results.classSimpleFolReasonerUses a naive brute force search procedure for theorem proving.classSpassFolReasonerInvokes 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 Description classAbstractMlReasonerAbstract modal reasoner to be implemented by concrete reasoners.classMleanCoPReasonerInvokes MleanCoP (http://www.leancop.de/mleancop/), a compact automated theorem prover for modal first-order logic based on the clausal connection calculus.classSimpleMlReasonerThis class implements inference for modal logic using a brute-force approach.classSPASSMlReasonerInvokes 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 Description classAbstractMlnReasonerThis class provides common methods for MLN reasoner.classAlchemyMlnReasonerThis class implements a wrapper for Alchemy in order to reason with MLNs.classApproximateNaiveMlnReasonerThis reasoner performs approximate reasoning with MLNs by considering only a subset of all Herbrand interpretations.classIteratingMlnReasonerThis MLN reasoner takes another MLN reasoner and performs several iterations with this one and takes the average result as result.classSimpleMlnReasonerclassSimpleSamplingMlnReasonerThis 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 Description classAbstractPclReasonerAbstract class for all PCL reasoners.classDefaultMeReasonerThis class implements a maximum entropy reasoner for probabilistic conditional logic.classGeneralizedMeReasonerThis 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 Description classAbstractPlReasonerAbstract class for propositional logic reasoners.classSatReasonerUses the default SAT reasoner to perform reasoning in propositional logicclassSimplePlReasonerNaive classical inference (checks all interpretations for satisfiability). -
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 Description classSimpleRelationalCReasonerThis 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 Description classSimpleDefaultReasonerImplements 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 Description classRpclMeReasonerGeneral ME-reasoner for RPCL. -
Uses of Reasoner in net.sf.tweety.lp.asp.reasoner
Classes in net.sf.tweety.lp.asp.reasoner that implement Reasoner Modifier and Type Class Description classASPSolverThis class provides a common interface for asp solvers.classClingoSolverInvokes Clingo (Part of the Potassco project), an ASP system that grounds and solves logic programs, and returns computed answer sets.classDLVSolverWrapper class for the DLV answer set solver command line utility.
-