A knowledge-belief frame (KB-frame for short, see e.g. [17], pg. 89) is a Kripke frame of the form (S, → a , ∼ a ) a∈A , with a given set of states S and two binary relations for each agent; the first relation ∼ a is meant to capture the knowledge of agent a, while the second → a captures his beliefs. A KB frame is required to satisfy the following natural conditions: (1) each ∼ a is reflexive: s ∼ a s; (2) if s ∼ a t then we have: s → a w iff t → a w, and also s ∼ a w iff t ∼ a w; (3) if s → a t then s ∼ a t ; (4) [...]
Answer
for every s ∈ S there e xists some t ∈ S such that s → a t.
A knowledge-belief frame (KB-frame for short, see e.g. [17], pg. 89) is a Kripke frame of the form (S, → a , ∼ a ) a∈A , with a given set of states S and two binary relations for each agent; the first relation ∼ a is meant to capture the knowledge of agent a, while the second → a captures his beliefs. A KB frame is required to satisfy the following natural conditions: (1) each ∼ a is reflexive: s ∼ a s; (2) if s ∼ a t then we have: s → a w iff t → a w, and also s ∼ a w iff t ∼ a w; (3) if s → a t then s ∼ a t ; (4) [...]
A knowledge-belief frame (KB-frame for short, see e.g. [17], pg. 89) is a Kripke frame of the form (S, → a , ∼ a ) a∈A , with a given set of states S and two binary relations for each agent; the first relation ∼ a is meant to capture the knowledge of agent a, while the second → a captures his beliefs. A KB frame is required to satisfy the following natural conditions: (1) each ∼ a is reflexive: s ∼ a s; (2) if s ∼ a t then we have: s → a w iff t → a w, and also s ∼ a w iff t ∼ a w; (3) if s → a t then s ∼ a t ; (4) [...]
Answer
for every s ∈ S there e xists some t ∈ S such that s → a t.
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open it beliefs. A KB frame is required to satisfy the following natural conditions: (1) each ∼ a is reflexive: s ∼ a s; (2) if s ∼ a t then we have: s → a w iff t → a w, and also s ∼ a w iff t ∼ a w; (3) if s → a t then s ∼ a t ; (4) <span>for every s ∈ S there e xists some t ∈ S such that s → a t.<span><body><html>
Original toplevel document (pdf)
owner: rappatoni - (no access) - Baltag and Smets - conditional doxastic models a qualiltative approach to odynamic belief revision.pdf, p4
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.