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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
Characterizes iterated admissibility via the 'all I know' operator, first with LPSs to address Samuelson's concern and then with approximate belief and approximate 'all I know' in standard probability structures.
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.
-
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
Characterizes iterated admissibility via the 'all I know' operator, first with LPSs to address Samuelson's concern and then with approximate belief and approximate 'all I know' in standard probability structures.