Uses of Class
org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner
Package
Description
-
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.aspic.reasoner
ModifierConstructorDescriptionAbstractAspicReasoner(AbstractExtensionReasoner aafReasoner)
Creates a new instanceDirectionalAspicReasoner(AbstractExtensionReasoner aafReasoner)
Creates a new instanceDirectionalAspicReasoner(AbstractExtensionReasoner aafReasoner, double prob)
Creates a new instanceModuleBasedAspicReasoner(AbstractExtensionReasoner aafReasoner)
Creates a new instanceRandomAspicReasoner(AbstractExtensionReasoner aafReasoner, int maxArguments, int maxDuplicates)
Creates a new instance.SimpleAspicReasoner(AbstractExtensionReasoner aafReasoner)
Creates a new instance -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.learning
ModifierConstructorDescriptionExampleFinder(AbstractExtensionReasoner reasoner1, AbstractExtensionReasoner reasoner2)
initialize with two specific reasonersExtendedExampleFinder(AbstractExtensionReasoner reasoner1, AbstractExtensionReasoner reasoner2, AbstractExtensionReasoner reasoner3)
initialize with three specific reasoners -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.principles
Modifier and TypeMethodDescriptionboolean
AdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
CFReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ConflictFreePrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
DirectionalityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
IMaximalityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
INRAPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ModularizationPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
NaivetyPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
abstract boolean
Principle.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ReductAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
SccDecomposabilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
SCOOCPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
SemiQualifiedAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
StrongAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
WeakReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
-
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.reasoner
Modifier and TypeClassDescriptionclass
Uses a provided SAT solver to solve reasoning problems in AAFs.class
This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.class
Reasoner for qualified sigma-semantics.class
Uses a SAT solver to determine complete extensions.class
Uses a SAT solver to determine stable extensions.class
Reasoner for CF2 extensions using scc-recursiveness.class
Reasoner for SCF2 extensions using scc-recursiveness.class
reasoner for SCOOC-naive semantics.class
Reasoner for semi-qualified sigma-semantics.class
This reasoner for Dung theories performs inference on the admissible extensions.class
This reasoner for Dung theories performs inference on the complete extensions.class
This reasoner for Dung theories performs inference on the conflict-free extensions.class
simple reasoner for eager semanticsclass
This reasoner for Dung theories performs inference on the grounded extension.class
This reasoner for Dung theories performs inference on the ideal extension.class
Reasoner for naive extensions.class
This reasoner for Dung theories performs inference on the preferred extensions.class
This reasoner for Dung theories performs inference on the resolution-based family of semantics.class
This reasoner for Dung theories performs inference on the complete extensions.class
Universal scc-recursive reasoner initialize with any reasoner for a scc-recursive semanticsclass
This reasoner for Dung theories performs inference on the semi-stable extensions.class
This reasoner for Dung theories performs inference on the stable extensions.class
This reasoner for Dung theories performs inference on the stage extensions.class
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
Reasoner for Stage2 semantics using scc-recursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012class
Reasoner for strong admissibility A set of arguments E is strongly admissible iff all every argument A in E is defended by some argument B in E \ {A} i.e.class
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
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
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
Reasoner for weakly preferred semantics see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.Modifier and TypeMethodDescriptionstatic AbstractExtensionReasoner
AbstractExtensionReasoner.getSimpleReasonerForSemantics(Semantics semantics)
Creates a reasoner for the given semantics.ModifierConstructorDescriptionEeeAcceptabilityReasoner(AbstractExtensionReasoner reasoner, InferenceMode inferenceMode)
Creates a new EeeAcceptabilityReasoner.IaqAcceptabilityReasoner(AbstractExtensionReasoner reasoner, InferenceMode inferenceMode)
Creates a new IaqAcceptabilityReasoner.QualifiedReasoner(AbstractExtensionReasoner reasoner)
initialize reasoner with the given reasoner as base reasoner Will only produce meaningful results if the given semantics is SCC-decomposableinitialize the scc-recursive reasoner with the given reasoner as base function -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.saf.reasoner
ModifierConstructorDescriptionOutputReasoner(AbstractExtensionReasoner reasoner)
Creates a new reasoner