Uses of Interface
org.tweetyproject.commons.postulates.PostulateEvaluatable
Package
Description

Uses of PostulateEvaluatable in org.tweetyproject.arg.dung.principles
Modifier and TypeMethodDescriptionboolean
Principle.isSatisfied
(Collection<Argument> kb, PostulateEvaluatable<Argument> ev) 
Uses of PostulateEvaluatable in org.tweetyproject.arg.dung.reasoner
Modifier and TypeClassDescriptionclass
Ancestor class for all extensionbased 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 sigmasemantics.class
Uses a SAT solver to determine complete extensions.class
Uses a SAT solver to determine stable extensions.class
Reasoner for CF2 extensions using sccrecursiveness.class
Reasoner for SCF2 extensions using sccrecursiveness.class
reasoner for SCOOCnaive semantics.class
Reasoner for semiqualified sigmasemantics.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 conflictfree 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 nonempty and minimal among the nonempty 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 resolutionbased family of semantics.class
This reasoner for Dung theories performs inference on the complete extensions.class
Universal sccrecursive reasoner initialize with any reasoner for a sccrecursive 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 soliddefends 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 sccrecursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCCrecursive 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
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 argumentationsemantics based on weak admissibility and weak defense.class
Reasoner for weakly grounded semantics a set of arguments E is wgrounded iff it is wcomplete and minimal Note: unlike the grounded extension which is unique, there can be more than one wgrounded extension see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentationsemantics based on weak admissibility and weak defense.class
Reasoner for weakly preferred semantics see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentationsemantics based on weak admissibility and weak defense. 
Uses of PostulateEvaluatable in org.tweetyproject.arg.dung.reasoner.serialisable
Modifier and TypeClassDescriptionclass
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 semanticsclass
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
Serialised reasoner for the unchallenged semantics The unchallenged semantics amounts to exhaustively adding unattacked and unchallenged initial sets 
Uses of PostulateEvaluatable in org.tweetyproject.arg.rankings.postulates
Modifier and TypeMethodDescriptionboolean
RankingPostulate.isSatisfied
(Collection<Argument> kb, PostulateEvaluatable<Argument> ev) 
Uses of PostulateEvaluatable 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 "Burdenbased" argument semantics approach as proposed by [Amgoud, BenNaim.class
This class implements the "hcategorizer" 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 CounterTransitivity 2017].class
This class implements the argument ranking approach of [Pu, Zhang, G.Luo, J.Luo.class
This class implements the "Discussionbased" argument semantics approach as proposed by [Amgoud, BenNaim.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, LagasquieSchiex. 
Uses of PostulateEvaluatable in org.tweetyproject.arg.setaf.reasoners
Modifier and TypeClassDescriptionclass
Ancestor class for all SetAfextensionbased 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 conflictfree 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
Reasoner for naive extensions.class
This reasoner for setaf theories performs inference on the preferred extensions.class
This reasoner for setaf theories performs inference on the semistable 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 PostulateEvaluatable in org.tweetyproject.commons.postulates
Modifier and TypeMethodDescriptionboolean
Postulate.isSatisfied
(Collection<S> kb, PostulateEvaluatable<S> ev) Checks whether this postulate is satisfied by the given approachev
wrt.ModifierConstructorDescriptionPostulateEvaluationReport
(PostulateEvaluatable<S> ev, List<Postulate<S>> postulates) Creates a new evaluation report for the given approach and set of postulatesPostulateEvaluator
(BeliefSetIterator<T, U> iterator, PostulateEvaluatable<T> ev) Creates a new evaluator for the given evaluatable and belief base generator.PostulateEvaluator
(BeliefSetIterator<T, U> iterator, PostulateEvaluatable<T> ev, Collection<Postulate<T>> postulates) Creates a new evaluator for the given evaluatable and belief base generator. 
Uses of PostulateEvaluatable in org.tweetyproject.logics.commons.analysis
Modifier and TypeClassDescriptionclass
BeliefSetInconsistencyMeasure<S extends Formula>
Classes extending this abstract class represent inconsistency measures on belief sets.class
CcInconsistencyMeasure<S extends Formula>
This class implements the inconsistency measure I_CC from [Said Jabbour and Yue Ma and Badran Raddaoui.class
CspInconsistencyMeasure<S extends Formula>
This class implements the inconsistency measure I_CSP from [Said Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi.class
DfInconsistencyMeasure<S extends Formula>
This class implements the family of "Measures of the Degree of Inconsistency" from [Mu,Liu,Jin, Bell.class
DHitInconsistencyMeasure<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class implements the dhit inconsistency measure from [Grant, Hunter.class
DMaxInconsistencyMeasure<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class implements the dmax inconsistency measure from [Grant, Hunter.class
DrasticInconsistencyMeasure<S extends Formula>
This class models the drastic inconsistency measure.class
DSumInconsistencyMeasure<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class implements the dsum inconsistency measure from [Grant, Hunter.class
EtaInconsistencyMeasure<B extends BeliefBase,
S extends Formula> This class implements the Etainconsistency measure, cf.class
HsInconsistencyMeasure<B extends BeliefBase,
S extends Formula> This class implements the Hitting Set inconsistency measure as proposed in [Thimm, 2014, in preparation].class
IsInconsistencyMeasure<S extends Formula>
This class implements the inconsistency measure I_CSP from [Said Jabbour.class
MaInconsistencyMeasure<S extends Formula>
This class models the I_M inconsistency measure from e.g.class
McscInconsistencyMeasure<S extends Formula>
This class implements the approach of [Meriem Ammoura, Badran Raddaoui, Yakoub Salhi, Brahim Oukacha.class
MicInconsistencyMeasure<S extends Formula>
This class models the MI^C inconsistency measure.class
MiInconsistencyMeasure<S extends Formula>
This class models the MI inconsistency measure.class
NConsInconsistencyMeasure<S extends Formula>
This class implements an inconsistency measure based on "nconsistency" proposed in [Doder,Raskovic,Markovic,Ognjanovic.class
NormalizedMicInconsistencyMeasure<S extends Formula>
This class models the normalized MI^C inconsistency measure, see [PhD thesis, Thimm].class
NormalizedMiInconsistencyMeasure<S extends Formula>
This class models the normalized MI inconsistency measure, see [PhD thesis, Thimm].class
PrInconsistencyMeasure<S extends Formula>
This class models the P inconsistency measure from e.g. 
Uses of PostulateEvaluatable in org.tweetyproject.logics.commons.analysis.streams
Modifier and TypeClassDescriptionclass
DefaultStreamBasedInconsistencyMeasure<S extends Formula>
Implements a streambased inconsistency measure on a given class of inconsistency measurement processes.class
StreamBasedInconsistencyMeasure<S extends Formula>
General interface for inconsistency measures working on streams. 
Uses of PostulateEvaluatable in org.tweetyproject.logics.pcl.analysis
Modifier and TypeClassDescriptionclass
This class models the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], extended by the use of different pnorms.class
This class models an approximation from below to the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], see [PhD thesis, Thimm].class
This class models the minimal violation inconsistency measure for the 2norm.class
This class provides a general implementation for the minimal violation inconsistency measure, cf.class
This class models the normalized distance minimization inconsistency measure, see [PhD thesis, Thimm].class
This class models a normalized approximation from below to the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], see [PhD thesis, Thimm].class
This class models a normalized approximation from above to the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], see [PhD thesis, Thimm].class
This class models an approximation from above to the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], see [PhD thesis, Thimm]. 
Uses of PostulateEvaluatable in org.tweetyproject.logics.pl.analysis
Modifier and TypeClassDescriptionclass
Provides an interface to a command line based inconsistency measure analyzerclass
This class implements the contension inconsistency measure, cf.class
This class implements a SAT encoding of the contension inconsistency measure, originally proposed in [Grant, Hunter.class
This class presents a satencodingbased implementation of the hitdistance measure of [Grant and Hunter, “Analysing inconsistent information using distancebased measures” Int.class
This class presents a satencodingbased implementation of the maxdistance measure of [Grant and Hunter, “Analysing inconsistent information using distancebased measures” Int.class
This class presents a satencodingbased implementation of the sumdistance measure of [Grant and Hunter, “Analysing incThis measure seeks an interpretation I such that the the sum of the distances between every formula of the knowledge base and I is minimal.class
Implements the forgettingbased inconsistency measure from [Besnard.class
This measure implements the approach presented in [Thimm, Measuring Inconsistency with ManyValued Logics.class
This class implements a SAT encoding of the hitting set inconsistency measure, originally proposed in [Thimm.class
This class implements the inconsistency measures proposed in [De Bona, Hunter.class
This class implements the "MUSvariable based inconsistency measure" proposed in [Xiao,Ma.class
This class implements the inconsistency measure I_{P_m} proposed in [Jabbour, Raddaoui.class
computes the inconsistency measure of theclass
A common base class for inconsistency measure implementations based on SAT encodings. 
Uses of PostulateEvaluatable in org.tweetyproject.logics.pl.postulates
Modifier and TypeMethodDescriptionboolean
ImPostulate.isSatisfied
(Collection<PlFormula> kb, PostulateEvaluatable<PlFormula> ev)