Preferential entailment

Preferential entailment is a non-monotonic logic based on selecting only models that are considered the most plausible. The plausibility of models is expressed by an ordering among models called a preference relation, hence the name preference entailment.

Formally, given a propositional formula ${\displaystyle F}$ and an ordering over propositional models ${\displaystyle \leq }$, preferential entailment selects only the models of ${\displaystyle F}$ that are minimal according to ${\displaystyle \leq }$. This selection leads to a non-monotonic inference relation: ${\displaystyle F\models _{\text{pref}}G}$ holds if and only if all minimal models of ${\displaystyle F}$ according to ${\displaystyle \leq }$ are also models of ${\displaystyle G}$.^[1]

Circumscription can be seen as the particular case of preferential entailment when the ordering is based on containment of the sets of variables assigned to true (in the propositional case) or containment of the extensions of predicates (in the first-order logic case).^[1]

See also

• Rational consequence relation – type of consequence relation in mathematical logicPages displaying wikidata descriptions as a fallback

References

1. Shoham, Y. (1987), "Nonmonotonic logics: Meaning and utility", Proc. of the 10th Int. Joint Conf. on Artificial Intelligence (IJCAI'87) (PDF), pp. 388–392.