Uses of Interface
org.tweetyproject.commons.ModelProvider
Package
Description
-
Uses of ModelProvider in org.tweetyproject.arg.aba.reasoner
Modifier and TypeClassDescriptionclass
CompleteReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the complete extensions.class
FlatAbaReasoner<T extends Formula>
This class models a reasoner over ABA formulae.class
GeneralAbaReasoner<T extends Formula>
This is an abstract generalization over non-flat ABA reasoners.class
IdealReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the ideal extension.class
PreferredReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the preferred extensions.class
StableReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the stable extensions.class
WellFoundedReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the ideal extension. -
Uses of ModelProvider in org.tweetyproject.arg.dung.reasoner
Modifier and TypeClassDescriptionclass
Ancestor class for all claim based reasoner.class
Ancestor class for all extension-based reasoners.class
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
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
calculates claim based inherited extensionsclass
calculates claim based naive extensionsclass
calculates claim based preferred reasonerclass
a simple claimbased semi stable reasonerclass
a claim based stable reaonserclass
calculates claim based staged extensionsclass
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
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.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 calculates claim based semi stable extensionsclass
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
This class implements a stratified labeling reasoner.class
Reasoner for strong admissibilityclass
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 ModelProvider in org.tweetyproject.arg.dung.reasoner.serialisable
Modifier and TypeClassDescriptionclass
Ancestor class for serialisable AF reasonersclass
Serialised version of the admissible semanticsclass
Serialised version of the complete semanticsclass
Serialised version of the grounded semanticsclass
Serialised version of the preferred semanticsclass
Serialised version of the stable semanticsclass
This class represents a reasoner to compute the extensions of the strongly admissibleSemantics
by serialising unattacked initial sets.class
Serialised reasoner for the unchallenged semantics The unchallenged semantics amounts to exhaustively adding unattacked and unchallenged initial sets -
Uses of ModelProvider in org.tweetyproject.arg.extended.reasoner
Modifier and TypeClassDescriptionclass
Abstract extension reasoner for reasoning with extended theoriesclass
General reasoner for extended theories that computes extended by flattening and then computing the AF extensionsclass
Simple reasoner for computing admissible sets of extended theories.class
Simple reasoner for computing complete extensions of extended theories.class
Simple reasoner for computing conflict-free sets of extended theories. -
Uses of ModelProvider in org.tweetyproject.arg.rankings.reasoner
Modifier and TypeClassDescriptionclass
AbstractRankingReasoner<R extends GeneralComparator<Argument,
DungTheory>> Common abstract class for ranking reasoners for abstract argumentation.class
This class implements the "Burden-based" argument semantics approach as proposed by [Amgoud, Ben-Naim.class
This class implements the "h-categorizer" argument ranking approach that was originally proposed by [Besnard, Hunter.class
This class implements the argument ranking approach of [Pu, Luo, Ranking Arguments based on Counter-Transitivity 2017].class
This class implements the argument ranking approach of [Pu, Zhang, G.Luo, J.Luo.class
This class implements the "Discussion-based" argument semantics approach as proposed by [Amgoud, Ben-Naim.class
This class implements the argument ranking approach of [Grossi, Modgil.class
Implements a graded semantics reasoner based on the ideas from [Thimm, Cerutti, Rienstra.class
This class implements the argument ranking approach of [Delobelle.class
This class implements the social abstract argumentation approach as proposed by [Bonzon, Delobelle, Konieczny, Maudet.class
Implements the serialisable ranking semantics from [Blümel, Thimm.class
This class implements the argument ranking approach of [Matt, Toni.class
This class implements the "tuples*" argument ranking approach as proposed by [Cayrol, Lagasquie-Schiex. -
Uses of ModelProvider in org.tweetyproject.arg.setaf.reasoners
Modifier and TypeClassDescriptionclass
Ancestor class for all SetAf-extension-based reasoners.class
This reasoner for SetAf theories performs inference on the admissible extensions.class
This reasoner for SetAf theories performs inference on the complete extensions.class
This reasoner for SetAf theories performs inference on the conflict-free extensions.class
simple reasoner for eager semanticsclass
This reasoner for SetAf theories performs inference on the grounded extension.class
This reasoner for setAf theories performs inference on the ideal extension.class
This reasoner for setaf theories performs inference on the preferred extensions.class
This reasoner for setaf theories performs inference on the semi-stable extensions.class
This reasoner for setaf theories performs inference on the stable extensions.class
This reasoner for setaf theories performs inference on the stage extensions. -
Uses of ModelProvider in org.tweetyproject.arg.social.reasoner
Modifier and TypeClassDescriptionclass
This reasoner provides is an implementation of the "Iterative Successive Substitution Algorithm" from [Marco Correia and Jorge Cruz and João Leite. -
Uses of ModelProvider in org.tweetyproject.logics.cl.reasoner
Modifier and TypeClassDescriptionclass
Abstract ancestor for all reasoner for conditional logic.class
This class models a c-reasoner for conditional logic.class
This is a reasoner using c-representation and rules to solve these c-representations.class
This class models a brute force c-reasoner for conditional logic.class
This class models a z-reasoner for conditional logic. -
Uses of ModelProvider in org.tweetyproject.logics.pcl.reasoner
Modifier and TypeClassDescriptionclass
Abstract class for all PCL reasoners.class
This class implements a maximum entropy reasoner for probabilistic conditional logic.class
This 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 ModelProvider in org.tweetyproject.logics.pl.analysis
ModifierConstructorDescriptionSimpleMinimalModelProvider
(ModelProvider<?, PlBeliefSet, InterpretationSet<Proposition, PlBeliefSet, PlFormula>> modelProvider) standard constructor with model provider -
Uses of ModelProvider in org.tweetyproject.logics.pl.sat
-
Uses of ModelProvider in org.tweetyproject.logics.rcl.reasoner
Modifier and TypeClassDescriptionclass
This class models a relational brute force c-reasoner for relational conditional logic. -
Uses of ModelProvider in org.tweetyproject.logics.rdl.reasoner
Modifier and TypeClassDescriptionclass
Implements a naive reasoner for default logic based on exhaustive application of defaults in process trees. -
Uses of ModelProvider in org.tweetyproject.logics.rpcl.reasoner
-
Uses of ModelProvider in org.tweetyproject.lp.asp.reasoner
Modifier and TypeClassDescriptionclass
This class provides a common interface for asp solvers.class
Invokes Clingo (Part of the Potassco project), an ASP system that grounds and solves logic programs, and returns computed answer sets.class
Wrapper class for the DLV answer set solver command line utility.