Learning in a changing world, an algebraic modal logical approach

Authors:
Prakash Panangaden;Mehrnoosh Sadrzadeh
Affiliations:
School of Computer Science, McGill University, Montréal, Canada;Oxford University Computing Laboratory, Oxford, UK
Venue:
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Year:
2010

Citing 12
Cited 1

Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
Reasoning about knowledge

Reasoning about knowledge
Dynamic Logic

Dynamic Logic
Knowledge and common knowledge in a distributed environment

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Temporal algebra

Mathematical Structures in Computer Science
Dynamic epistemic logic with assignment

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Kleene algebra with domain

ACM Transactions on Computational Logic (TOCL)
Actions and resources in epistemic logic

Actions and resources in epistemic logic
From DEL to EDL: Exploring the Power of Converse Events

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dynamic Epistemic Logic

Dynamic Epistemic Logic
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information

Electronic Notes in Theoretical Computer Science (ENTCS)
Prime algebraicity

Theoretical Computer Science

Dynamic epistemic algebra with post-conditions to reason about robot navigation

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We develop an algebraic modal logic that combines epistemic and dynamic modalities with a view to modelling information acquisition (learning) by automated agents in a changing world. Unlike most treatments of dynamic epistemic logic, we have transitions that "change the state" of the underlying system and not just the state of knowledge of the agents. The key novel feature that emerges is the need to have a way of "inverting transitions" and distinguishing between transitions that "really happen" and transitions that are possible. Our approach is algebraic, rather than being based on a Kripke-style semantics. The semantics are given in terms of quantales. We study a class of quantales with the appropriate inverse operations and prove properties of the setting. We illustrate the ideas with toy robot-navigation problems. These illustrate how an agent learns information by taking actions.