Uses of Class
org.tweetyproject.arg.dung.reasoner.AbstractDungReasoner

Packages that use AbstractDungReasoner
  • Uses of AbstractDungReasoner in org.tweetyproject.arg.dung.reasoner

    Modifier and Type
    Class
    Description
    class 
    Ancestor class for reasoners that are tailored towards computing the set {a | a is credulously/skeptically accepted wrt.
    class 
    Ancestor class for all extension-based reasoners.
    class 
    Uses a provided SAT solver to solve reasoning problems in AAFs.
    class 
    Implements the EEE approach ("exhaustively enumerate extensions") to determine the set of acceptable arguments of an AF, cf.
    class 
    Implements the Fudge approach to determine the set of acceptable arguments of an AF wrt.
    class 
    Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.
    class 
    This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
    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 
    Implements the SEE approach ("selective extension enumeration") to determine the set of acceptable arguments of an AF wrt.
    class 
    Implements the SEEM approach ("selective extension enumeration with MaxSAT") to determine the set of credulously acceptable arguments of an AF wrt.
    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 semantics
    class 
    This reasoner for Dung theories performs inference on the grounded extension.
    class 
    This reasoner for Dung theories performs inference on the ideal extension.
    class 
    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 see: Yuming Xu and Claudette Cayrol.
    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 semantics
    class 
    This reasoner calculates claim based 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 2012
    class 
    This class implements a stratified labeling reasoner.
    class 
    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 
    Implements the strongly undisputed semantics, as proposed in [Thimm.
    class 
    Implements the undisputed semantics, as proposed in [Thimm.
    class 
    Implements a general vacuous reduct reasoner, as proposed in [Thimm.
    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.
  • Uses of AbstractDungReasoner in org.tweetyproject.arg.dung.reasoner.serialisable

    Modifier and Type
    Class
    Description
    class 
    Abstract class for computing extensions via a serialised transition system to implement this class, you need to define a selection and a termination function Selection function a(UA, UC, C): selects and returns a subset of the initial sets Termination function b((AF, S)): If the given state satisfies a specific condition, its extension may be accepted by the associated serialised semantics
    class 
    Serialised version of the admissible semantics
    class 
    Serialised version of the complete semantics
    class 
    Serialised version of the grounded semantics
    class 
    Serialised version of the preferred semantics
    class 
    Serialised version of the stable semantics
    class 
    Serialised reasoner for the unchallenged semantics The unchallenged semantics amounts to exhaustively adding unattacked and unchallenged initial sets