𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Epistemic entrenchment and possibilistic logic

✍ Scribed by Didier Dubois; Henri Prade

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
896 KB
Volume
50
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis

Dubois, D. and H. Prade, Epistemic entrenchment and possibilistic logic (Research Note), Artificial Intelligence 50 (1991) 223-239.

This note points out the close relationships existing between recent proposals in the theory of belief revision made by Gardenf6rs based on the notion of epistemic entrenchment, and possibility theory applied to automated reasoning under uncertainty. It is claimed that the only numerical counterparts of epistemic entrenchment relations are so-called necessity measures that are dual to possibility measures, and are also mathematically equivalent to consonant belief functions in the sense of Sharer. Relationships between Spohn's ordinal conditional functions and possibility theory are also laid bare.

πŸ“œ SIMILAR VOLUMES

Epistemic entrenchment and arithmetical
Epistemic entrenchment and arithmetical hierarchy
✍ Petr HΓ‘jek πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 467 KB

Hfijek, P., Epistemic entrenchment and arithmetical hierarchy (Research Note), Artificial Intelligence 62 (1993) 79-87. If the underlying theory is sufficiently rich (e.g. like first-order arithmetic), then no epistemic entrenchment preorder of sentences is recursively enumerable. Consequently, the

Epistemic logic and logical omniscience:
Epistemic logic and logical omniscience: A survey
✍ Kwang Mong Sim πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 217 KB

This survey brings together a collection of epistemic logics and discusses their approaches in alleviating the logical omniscience problem. Of particular note is the logic of implicit and explicit belief. Explicit belief refers to information actively held by an agent, while implicit belief refers t

Infinitary S5-Epistemic Logic
Infinitary S5-Epistemic Logic
✍ Aviad Heifetz πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 569 KB

## Abstract It is known that a theory in S5‐epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas.