A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.
Furthermore, by the fact that (B′,B⊤)|=⃝1p and (B′′,B⊤)|=⃝1p, we have that: ∀B′′′′∈ R[ [λ′] ](B′′),∃B′′′∈ R[ [λ′] ](B′) such that ( V′′′′∩ Atm(π) ) = ( V′′′∩ Atm(π) )
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exploiting Belief Bases for Building Rich Epistemic Structures
A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.