| 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.
|
| ImAttenuation |
The "attenuation" postulate for inconsistency measures: Minimal inconsistent
sets of smaller size should have a larger inconsistency value.
|
| 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.
|
| ImContradiction |
The "contradiction" postulate for inconsistency measures: A knowledge base
is maximally inconsistent if all non-empty subsets are inconsistent.
|
| ImDominance |
The "dominance" postulate for inconsistency measures: Substituting a
consistent formula by a weaker formula should not increase the inconsistency
value.
|
| ImEqualConflict |
The "equal conflict" postulate for inconsistency measures: Minimal inconsistent subsets
of the same size should have the same inconsistency value.
|
| ImExchange |
The "exchange" postulate for inconsistency measures: Exchanging consistent parts
of a knowledge base with equivalent ones should not change the inconsistency value.
|
| 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.
|
| 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.
|
| ImIrrelevanceOfSyntax |
The "irrelevance of syntax" postulate for inconsistency measures: Knowledge
bases with pairwise equivalent formulas should receive the same inconsistency
value.
|
| ImMINormalization |
The "MI-normalization" postulate for inconsistency measures: The inconsistency
value of any minimal inconsistent subset is 1.
|
| 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.
|
| ImMonotony |
The "monotony" postulate for inconsistency measures: Adding information
to a belief base cannot decrease the inconsistency value.
|
| 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.
|
| ImPenalty |
The "penalty" postulate for inconsistency measures: Adding a formula that participates
in an inconsistency (i.e.
|
| ImPostulate |
An abstract postulate for inconsistency measures in propositional
logic; the ancestor of all concrete postulates.
|
| ImSafeFormulaIndependence |
The "safe-formula independence" postulate for inconsistency measures: Removing a safe
formula (i.e.
|
| 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.
|
| ImWeakDominance |
A weaker variant of the "dominance" postulate using prime implicates,
proposed in [Jabbour et al.
|