Package org.tweetyproject.arg.dung.reasoner
package org.tweetyproject.arg.dung.reasoner
-
ClassDescriptionAncestor class for reasoners that are tailored towards computing the set {a | a is credulously/skeptically accepted wrt.Ancestor class for all claim based reasoner.Ancestor class for all AAF reasoners.Ancestor class for all extension-based reasoners.Uses a provided SAT solver to solve reasoning problems in AAFs.Implements the EEE approach ("exhaustively enumerate extensions") to determine the set of acceptable arguments of an AF, cf.Reasoner using ranking semantics.Implements the Fudge approach to determine the set of acceptable arguments of an AF wrt.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.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.Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.Reasoner for incomplete argumentation frameworksInterface for reasoner capable of optimising k extensions.A MaxSAT-based implementation for solving the MaxStable* problem from [Thimm.A MaxSAT-based implementation for solving the MaxStable problem from [Thimm.This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.This enum contains all supported problems for probo-based reasoner.The actual computational sub-problem.This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.Reasoner for qualified sigma-semantics.Uses a SAT solver to determine complete extensions.Uses a SAT solver to determine stable extensions.Reasoner for CF2 extensions using scc-recursiveness.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.Reasoner for SCF2 extensions using scc-recursiveness.reasoner for SCOOC-naive semantics.Implements the SEE approach ("selective extension enumeration") to determine the set of acceptable arguments of an AF wrt.Implements the SEEM approach ("selective extension enumeration with MaxSAT") to determine the set of credulously acceptable arguments of an AF wrt.Reasoner for semi-qualified sigma-semantics.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.This reasoner for Dung theories performs inference on the admissible extensions.calculates claim based inherited extensionscalculates claim based naive extensionscalculates claim based preferred reasonera simple claimbased semi stable reasonera claim based stable reaonsercalculates claim based staged extensionsThis reasoner for Dung theories performs inference on the complete extensions.This reasoner for Dung theories performs inference on the conflict-free extensions.simple reasoner for eager semanticsThis reasoner for Dung theories performs inference on the grounded extension.This reasoner for Dung theories performs inference on the ideal extension.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.The
Initialenum represents the initial status of arguments in a Dung theory.Reasoner for naive extensions.This reasoner for Dung theories performs inference on the preferred extensions.This reasoner for Dung theories performs inference on the resolution-based family of semantics.This reasoner for Dung theories performs inference on the complete extensions.Universal scc-recursive reasoner initialize with any reasoner for a scc-recursive semanticsThis reasoner calculates claim based semi stable extensionsThis reasoner for Dung theories performs inference on the stable extensions.This reasoner for Dung theories performs inference on the stage extensions.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.Reasoner for Stage2 semantics using scc-recursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012This class implements a stratified labeling reasoner.Reasoner for strong admissibilityImplements the strongly undisputed semantics, as proposed in [Thimm.Implements the undisputed semantics, as proposed in [Thimm.Implements a general vacuous reduct reasoner, as proposed in [Thimm.Reasoner for weak admissibility the reasoner reduces the number of sets we have to check by computing candidate sets instead of checking all sets.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.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.Reasoner for weakly preferred semantics see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.