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

Packages that use PostulateEvaluatable

Package	Description
org.tweetyproject.arg.dung.principles
org.tweetyproject.arg.dung.reasoner
org.tweetyproject.arg.dung.reasoner.serialisable
org.tweetyproject.arg.extended.reasoner
org.tweetyproject.arg.rankings.postulates
org.tweetyproject.arg.rankings.reasoner
org.tweetyproject.arg.setaf.reasoners
org.tweetyproject.commons.postulates
org.tweetyproject.logics.commons.analysis
org.tweetyproject.logics.commons.analysis.streams
org.tweetyproject.logics.pcl.analysis
org.tweetyproject.logics.pl.analysis
org.tweetyproject.logics.pl.postulates

Uses of PostulateEvaluatable in org.tweetyproject.arg.dung.principles

Methods in org.tweetyproject.arg.dung.principles with parameters of type PostulateEvaluatable

Modifier and Type	Method	Description
boolean	Principle.isSatisfied(Collection<Argument> kb, PostulateEvaluatable<Argument> ev)

Uses of PostulateEvaluatable in org.tweetyproject.arg.dung.reasoner

Classes in org.tweetyproject.arg.dung.reasoner that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	AbstractExtensionReasoner	Ancestor class for all extension-based reasoners.
class	AbstractSatExtensionReasoner	Uses a provided SAT solver to solve reasoning problems in AAFs.
class	ProboI23Reasoner	This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
class	ProboReasoner	This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
class	QualifiedReasoner	Reasoner for qualified sigma-semantics.
class	SatCompleteReasoner	Uses a SAT solver to determine complete extensions.
class	SatStableReasoner	Uses a SAT solver to determine stable extensions.
class	SccCF2Reasoner	Reasoner for CF2 extensions using scc-recursiveness.
class	SCF2Reasoner	Reasoner for SCF2 extensions using scc-recursiveness.
class	SCOOCNaiveReasoner	reasoner for SCOOC-naive semantics.
class	SemiQualifiedReasoner	Reasoner for semi-qualified sigma-semantics.
class	SimpleAdmissibleReasoner	This reasoner for Dung theories performs inference on the admissible extensions.
class	SimpleCompleteReasoner	This reasoner for Dung theories performs inference on the complete extensions.
class	SimpleConflictFreeReasoner	This reasoner for Dung theories performs inference on the conflict-free extensions.
class	SimpleEagerReasoner	simple reasoner for eager semantics
class	SimpleGroundedReasoner	This reasoner for Dung theories performs inference on the grounded extension.
class	SimpleIdealReasoner	This reasoner for Dung theories performs inference on the ideal extension.
class	SimpleInitialReasoner	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	SimpleNaiveReasoner	Reasoner for naive extensions.
class	SimplePreferredReasoner	This reasoner for Dung theories performs inference on the preferred extensions.
class	SimpleResolutionBasedReasoner	This reasoner for Dung theories performs inference on the resolution-based family of semantics.
class	SimpleSccCompleteReasoner	This reasoner for Dung theories performs inference on the complete extensions.
class	SimpleSccRecursiveReasoner	Universal scc-recursive reasoner initialize with any reasoner for a scc-recursive semantics
class	SimpleSemiStableReasoner	This reasoner calculates claim based semi stable extensions
class	SimpleStableReasoner	This reasoner for Dung theories performs inference on the stable extensions.
class	SimpleStageReasoner	This reasoner for Dung theories performs inference on the stage extensions.
class	SolidAdmissibleReasoner	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	Stage2Reasoner	Reasoner for Stage2 semantics using scc-recursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012
class	StronglyAdmissibleReasoner	Reasoner for strong admissibility
class	StronglyUndisputedReasoner	Implements the strongly undisputed semantics, as proposed in [Thimm.
class	UndisputedReasoner	Implements the undisputed semantics, as proposed in [Thimm.
class	VacuousReductReasoner	Implements a general vacuous reduct reasoner, as proposed in [Thimm.
class	WeaklyAdmissibleReasoner	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	WeaklyCompleteReasoner	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	WeaklyGroundedReasoner	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	WeaklyPreferredReasoner	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 PostulateEvaluatable in org.tweetyproject.arg.dung.reasoner.serialisable

Classes in org.tweetyproject.arg.dung.reasoner.serialisable that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	SerialisableExtensionReasoner	Ancestor class for serialisable AF reasoners
class	SerialisedAdmissibleReasoner	Serialised version of the admissible semantics
class	SerialisedCompleteReasoner	Serialised version of the complete semantics
class	SerialisedGroundedReasoner	Serialised version of the grounded semantics
class	SerialisedPreferredReasoner	Serialised version of the preferred semantics
class	SerialisedStableReasoner	Serialised version of the stable semantics
class	SerialisedStronglyAdmissibleReasoner	This class represents a reasoner to compute the extensions of the strongly admissible Semantics by serialising unattacked initial sets.
class	SerialisedUnchallengedReasoner	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.extended.reasoner

Classes in org.tweetyproject.arg.extended.reasoner that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	AbstractExtendedExtensionReasoner	Abstract extension reasoner for reasoning with extended theories
class	FlattenBasedExtendedExtensionReasoner	General reasoner for extended theories that computes extended by flattening and then computing the AF extensions
class	SimpleExtendedAdmissibleReasoner	Simple reasoner for computing admissible sets of extended theories.
class	SimpleExtendedCompleteReasoner	Simple reasoner for computing complete extensions of extended theories.
class	SimpleExtendedConflictFreeReasoner	Simple reasoner for computing conflict-free sets of extended theories.

Uses of PostulateEvaluatable in org.tweetyproject.arg.rankings.postulates

Methods in org.tweetyproject.arg.rankings.postulates with parameters of type PostulateEvaluatable

Modifier and Type	Method	Description
boolean	RankingPostulate.isSatisfied(Collection<Argument> kb, PostulateEvaluatable<Argument> ev)

Uses of PostulateEvaluatable in org.tweetyproject.arg.rankings.reasoner

Classes in org.tweetyproject.arg.rankings.reasoner that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	AbstractRankingReasoner<R extends GeneralComparator<Argument,DungTheory>>	Common abstract class for ranking reasoners for abstract argumentation.
class	BurdenBasedRankingReasoner	This class implements the "Burden-based" argument semantics approach as proposed by [Amgoud, Ben-Naim.
class	CategorizerRankingReasoner	This class implements the "h-categorizer" argument ranking approach that was originally proposed by [Besnard, Hunter.
class	CounterTransitivityReasoner	This class implements the argument ranking approach of [Pu, Luo, Ranking Arguments based on Counter-Transitivity 2017].
class	CountingRankingReasoner	This class implements the argument ranking approach of [Pu, Zhang, G.Luo, J.Luo.
class	DiscussionBasedRankingReasoner	This class implements the "Discussion-based" argument semantics approach as proposed by [Amgoud, Ben-Naim.
class	IteratedGradedDefenseReasoner	This class implements the argument ranking approach of [Grossi, Modgil.
class	ProbabilisticRankingReasoner	Implements a graded semantics reasoner based on the ideas from [Thimm, Cerutti, Rienstra.
class	PropagationRankingReasoner	This class implements the argument ranking approach of [Delobelle.
class	SAFRankingReasoner	This class implements the social abstract argumentation approach as proposed by [Bonzon, Delobelle, Konieczny, Maudet.
class	SerialisableRankingReasoner	Implements the serialisable ranking semantics from [Blümel, Thimm.
class	StrategyBasedRankingReasoner	This class implements the argument ranking approach of [Matt, Toni.
class	TuplesRankingReasoner	This class implements the "tuples*" argument ranking approach as proposed by [Cayrol, Lagasquie-Schiex.

Uses of PostulateEvaluatable in org.tweetyproject.arg.setaf.reasoners

Classes in org.tweetyproject.arg.setaf.reasoners that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	AbstractExtensionSetAfReasoner	Ancestor class for all SetAf-extension-based reasoners.
class	SimpleAdmissibleSetAfReasoner	This reasoner for SetAf theories performs inference on the admissible extensions.
class	SimpleCompleteSetAfReasoner	This reasoner for SetAf theories performs inference on the complete extensions.
class	SimpleConflictFreeSetAfReasoner	This reasoner for SetAf theories performs inference on the conflict-free extensions.
class	SimpleEagerSetAfReasoner	simple reasoner for eager semantics
class	SimpleGroundedSetAfReasoner	This reasoner for SetAf theories performs inference on the grounded extension.
class	SimpleIdealSetAfReasoner	This reasoner for setAf theories performs inference on the ideal extension.
class	SimplePreferredSetAfReasoner	This reasoner for setaf theories performs inference on the preferred extensions.
class	SimpleSemiStableSetAfReasoner	This reasoner for setaf theories performs inference on the semi-stable extensions.
class	SimpleStableSetAfReasoner	This reasoner for setaf theories performs inference on the stable extensions.
class	SimpleStageSetAfReasoner	This reasoner for setaf theories performs inference on the stage extensions.

Uses of PostulateEvaluatable in org.tweetyproject.commons.postulates

Methods in org.tweetyproject.commons.postulates with parameters of type PostulateEvaluatable

Modifier and Type	Method	Description
boolean	Postulate.isSatisfied(Collection<S> kb, PostulateEvaluatable<S> ev)	Checks whether this postulate is satisfied by the given approach ev wrt.

Constructors in org.tweetyproject.commons.postulates with parameters of type PostulateEvaluatable

Modifier	Constructor	Description
	PostulateEvaluationReport(PostulateEvaluatable<S> ev, List<Postulate<S>> postulates)	Creates a new evaluation report for the given approach and set of postulates
	PostulateEvaluator(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

Classes in org.tweetyproject.logics.commons.analysis that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	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 d-hit inconsistency measure from [Grant, Hunter.
class	DMaxInconsistencyMeasure<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula>	This class implements the d-max 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 d-sum inconsistency measure from [Grant, Hunter.
class	EtaInconsistencyMeasure<B extends BeliefBase,S extends Formula>	This class implements the Eta-inconsistency 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 "n-consistency" 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

Classes in org.tweetyproject.logics.commons.analysis.streams that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	DefaultStreamBasedInconsistencyMeasure<S extends Formula>	Implements a stream-based 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

Classes in org.tweetyproject.logics.pcl.analysis that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	DistanceMinimizationInconsistencyMeasure	This class models the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], extended by the use of different p-norms.
class	LowerApproxDistanceMinimizationInconsistencyMeasure	This class models an approximation from below to the distance minimization inconsistency measure as proposed in [Thimm,UAI,2009], see [PhD thesis, Thimm].
class	MinimalViolation2InconsistencyMeasure	This class models the minimal violation inconsistency measure for the 2-norm.
class	MinimalViolationInconsistencyMeasure	This class provides a general implementation for the minimal violation inconsistency measure, cf.
class	NormalizedDistanceMinimizationInconsistencyMeasure	This class models the normalized distance minimization inconsistency measure, see [PhD thesis, Thimm].
class	NormalizedLowerApproxDistanceMinimizationInconsistencyMeasure	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	NormalizedUpperApproxDistanceMinimizationInconsistencyMeasure	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	UpperApproxDistanceMinimizationInconsistencyMeasure	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

Classes in org.tweetyproject.logics.pl.analysis that implement PostulateEvaluatable

Modifier and Type	Class	Description
class	CmdLineImSolver	Provides an interface to a command line based inconsistency measure analyzer
class	ContensionInconsistencyMeasure	This class implements the contension inconsistency measure, cf.
class	ContensionSatInconsistencyMeasure	This class implements a SAT encoding of the contension inconsistency measure, originally proposed in [Grant, Hunter.
class	DHitSatInconsistencyMeasure	This class presents a sat-encoding-based implementation of the hit-distance measure of [Grant and Hunter, “Analysing inconsistent information using distance-based measures” Int.
class	DMaxSatInconsistencyMeasure	This class presents a sat-encoding-based implementation of the max-distance measure of [Grant and Hunter, “Analysing inconsistent information using distance-based measures” Int.
class	DSumSatInconsistencyMeasure	This class presents a sat-encoding-based implementation of the sum-distance 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	FbInconsistencyMeasure	Implements the forgetting-based inconsistency measure from [Besnard.
class	FuzzyInconsistencyMeasure	This measure implements the approach presented in [Thimm, Measuring Inconsistency with Many-Valued Logics.
class	HsSatInconsistencyMeasure	This class implements a SAT encoding of the hitting set inconsistency measure, originally proposed in [Thimm.
class	IcebergInconsistencyMeasure	This class implements the inconsistency measures proposed in [De Bona, Hunter.
class	MusVarInconsistencyMeasure	This class implements the "MUS-variable based inconsistency measure" proposed in [Xiao,Ma.
class	PmInconsistencyMeasure	This class implements the inconsistency measure I_{P_m} proposed in [Jabbour, Raddaoui.
class	PrimeImplicantBasedInconsistencyMeasure	computes the inconsistency measure of the
class	SatBasedInconsistencyMeasure	A common base class for inconsistency measure implementations based on SAT encodings.

Uses of PostulateEvaluatable in org.tweetyproject.logics.pl.postulates

Methods in org.tweetyproject.logics.pl.postulates with parameters of type PostulateEvaluatable

Modifier and Type	Method	Description
boolean	ImPostulate.isSatisfied(Collection<PlFormula> kb, PostulateEvaluatable<PlFormula> ev)