Package org.tweetyproject.arg.dung.reasoner
package org.tweetyproject.arg.dung.reasoner
-
Class SummaryClassDescriptionAncestor class for reasoners that are tailored towards computing the set {a | a is credulously/skeptically accepted wrt.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.Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.Reasoner for ordering semanticsThis 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.Reasoner for SCF2 extensions using scc-recursiveness.reasoner for SCOOC-naive semantics.Implements the SEE approach ("selective extension enumeration") to determine the set of credulously 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.This reasoner for Dung theories performs inference on the admissible extensions.This 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.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 for Dung theories performs inference on the semi-stable extensions.This 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 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.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.
-
Enum SummaryEnumDescriptionThis enum contains all supported problems for probo-based reasoner.The actual computational sub-problem.