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.
Journal of Logic and Computa- tion 11(1), pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2019 3verdicts
UNVERDICTED 3representative 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.
Introspection axioms are conservative for agent-alternating formulas in multi-agent belief logics (K/KD) but not in knowledge logics (KT).
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.
-
When Do Introspection Axioms Matter for Multi-Agent Epistemic Reasoning?
Introspection axioms are conservative for agent-alternating formulas in multi-agent belief logics (K/KD) but not in knowledge logics (KT).