Uses of Interface
net.sf.tweety.commons.postulates.Postulate
-
Packages that use Postulate Package Description net.sf.tweety.arg.rankings.postulates net.sf.tweety.commons.postulates net.sf.tweety.logics.pl.postulates -
-
Uses of Postulate in net.sf.tweety.arg.rankings.postulates
Classes in net.sf.tweety.arg.rankings.postulates that implement Postulate Modifier and Type Class Description class
RaAbstraction
The "abstraction" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RaAdditionOfAttackBranch
The "addition of attack branch" postulate for ranking semantics as formalized in [Bonzon, Delobelle, Konieczny, Maudet.class
RaAdditionOfDefenseBranch
The "addition of defense branch" postulate for ranking semantics as formalized in [Bonzon, Delobelle, Konieczny, Maudet.class
RaAttackVsFullDefense
The "attack vs full defense" postulate for ranking semantics as proposed in [Bonzon, Delobelle, Konieczny, Maudet.class
RaCardinalityPrecedence
The "cardinality precedence" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RaCounterTransitivity
The "counter-transitivity" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RaDefensePrecedence
The "defense precedence" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RaDistDefensePrecedence
The "distributed-defense precedence" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RaIncreaseOfAttackBranch
The "increase of attack branch" postulate for ranking semantics as formalized in [Bonzon, Delobelle, Konieczny, Maudet.class
RaIncreaseOfDefenseBranch
The "increase of defense branch" postulate for ranking semantics as formalized in [Bonzon, Delobelle, Konieczny, Maudet.class
RaIndependence
The "independence" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RankingPostulate
An abstract postulate for ranking-based semantics in abstract argumentation; the ancestor of all concrete postulates.class
RaNonAttackedEquivalence
The "non-attacked equivalence" postulate for ranking semantics as proposed in [Bonzon, Delobelle, Konieczny, Maudet.class
RaQualityPrecedence
The "quality precedence" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim.class
RaSelfContradiction
The "self-contradiction" postulate for ranking semantics as proposed in [Matt, Toni.class
RaStrictAdditionOfDefenseBranch
The "strict addition of defense branch" postulate for ranking semantics as formalized in [Bonzon, Delobelle, Konieczny, Maudet.class
RaStrictCounterTransitivity
The "strict counter-transitivity" postulate for ranking semantics as proposed by [Amgoud, Ben-Naim.class
RaTotal
The "total" postulate for ranking semantics as proposed in [Bonzon, Delobelle, Konieczny, Maudet.class
RaVoidPrecedence
The "void precedence" postulate for ranking semantics as proposed by [Amgoud, Ben-Naim. -
Uses of Postulate in net.sf.tweety.commons.postulates
Methods in net.sf.tweety.commons.postulates with parameters of type Postulate Modifier and Type Method Description void
PostulateEvaluationReport. addNegativeInstance(Postulate<S> postulate, java.util.Collection<S> instance)
Adds a negative instance for the given postulatevoid
PostulateEvaluationReport. addNotApplicableInstance(Postulate<S> postulate, java.util.Collection<S> instance)
Adds an instance that is not applicable for the given postulatevoid
PostulateEvaluationReport. addPositiveInstance(Postulate<S> postulate, java.util.Collection<S> instance)
Adds a positive instance for the given postulate (that is applicable)void
PostulateEvaluator. addPostulate(Postulate<T> p)
Adds the given postulatejava.util.Collection<java.util.Collection<S>>
PostulateEvaluationReport. getNegativeInstances(Postulate<S> postulate)
Returns the negative instances for the given postulateboolean
PostulateEvaluator. removePostulate(Postulate<T> p)
Removes the given postulateMethod parameters in net.sf.tweety.commons.postulates with type arguments of type Postulate Modifier and Type Method Description void
PostulateEvaluator. addAllPostulates(java.util.Collection<? extends Postulate<T>> postulates)
Adds all postulates in the given collection.void
PostulateEvaluator. removeAllPostulates(java.util.Collection<? extends Postulate<T>> postulates)
Removes all postulates in the given collection.Constructor parameters in net.sf.tweety.commons.postulates with type arguments of type Postulate Constructor Description PostulateEvaluationReport(PostulateEvaluatable<S> ev, java.util.List<Postulate<S>> postulates)
Creates a new evaluation report for the given approach and set of postulatesPostulateEvaluator(BeliefSetIterator<T,U> iterator, PostulateEvaluatable<T> ev, java.util.Collection<Postulate<T>> postulates)
Creates a new evaluator for the given evaluatable and belief base generator. -
Uses of Postulate in net.sf.tweety.logics.pl.postulates
Classes in net.sf.tweety.logics.pl.postulates that implement Postulate Modifier and Type Class Description class
ImAdjunctionInvariance
The "adjunction invariance" postulate for inconsistency measures: The set notation of knowledge bases should be equivalent to the conjunction of its formulas in terms of inconsistency values.class
ImAttenuation
The "attenuation" postulate for inconsistency measures: Minimal inconsistent sets of smaller size should have a larger inconsistency value.class
ImConsistency
The "consistency" postulate for inconsistency measures: Consistent knowledge bases receive the minimal inconsistency value (0) and all inconsistent knowledge bases have strictly positive inconsistency values.class
ImContradiction
The "contradiction" postulate for inconsistency measures: A knowledge base is maximally inconsistent if all non-empty subsets are inconsistent.class
ImDominance
The "dominance" postulate for inconsistency measures: Substituting a consistent formula by a weaker formula should not increase the inconsistency value.class
ImEqualConflict
The "equal conflict" postulate for inconsistency measures: Minimal inconsistent subsets of the same size should have the same inconsistency value.class
ImExchange
The "exchange" postulate for inconsistency measures: Exchanging consistent parts of a knowledge base with equivalent ones should not change the inconsistency value.class
ImFreeFormulaDilution
The "free-formula dilution" postulate for inconsistency measures: Removing a formula not participating in any minimal inconsistent set does not make the inconsistency value larger.class
ImFreeFormulaIndependence
The "free-formula independence" postulate for inconsistency measures: Removing a formula not participating in any minimal inconsistent set (= a free formula) does not change the inconsistency value.class
ImIrrelevanceOfSyntax
The "irrelevance of syntax" postulate for inconsistency measures: Knowledge bases with pairwise equivalent formulas should receive the same inconsistency value.class
ImMINormalization
The "MI-normalization" postulate for inconsistency measures: The inconsistency value of any minimal inconsistent subset is 1.class
ImMISeparability
The "MI-separability" postulate for inconsistency measures: The sum of inconsistency values of two knowledge bases with non-interfering sets of minimal inconsistent subsets should be the same as the inconsistency value of their union.class
ImMonotony
The "monotony" postulate for inconsistency measures: Adding information to a belief base cannot decrease the inconsistency value.class
ImNormalization
The "normalization" postulate for inconsistency measures: The inconsistency value is always in the unit interval [0,1], making it possible to compare inconsistency values for knowledge bases of different sizes.class
ImPenalty
The "penalty" postulate for inconsistency measures: Adding a formula that participates in an inconsistency (i.e.class
ImPostulate
An abstract postulate for inconsistency measures in propositional logic; the ancestor of all concrete postulates.class
ImSafeFormulaIndependence
The "safe-formula independence" postulate for inconsistency measures: Removing a safe formula (i.e.class
ImSuperAdditivity
The "super-additivity" postulate for inconsistency measures: The sum of the inconsistency values of two disjoint knowledge bases is not larger than the inconsistency value of the joint knowledge base.class
ImWeakDominance
A weaker variant of the "dominance" postulate using prime implicates, proposed in [Jabbour et al.
-