scholarly journals Towards a Logic for Reasoning About Learning in a Changing World

10.29007/8g5j ◽  
2018 ◽  
Author(s):  
Prakash Panangaden ◽  
Mehrnoosh Sadrzadeh
Keyword(s):  
Modal Logic ◽  
Epistemic Logic ◽  
Information Acquisition ◽  
Robot Navigation ◽  
Dynamic Epistemic Logic ◽  
The State ◽  
Changing World

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 introduce a class of quantales with the appropriate inverse operations and use it to model toy robot-navigation problems, which illustrate how an agent learns information by taking actions. We discuss how a sound and complete logic of the algebra may be obtained from the positive fragment of PDL with converse.

Constrained Epistemic Extension on Agent Knowledge Acquisition

2013 ◽  
Vol 651 ◽  
pp. 943-948
Author(s):  
Zhi Ling Hong ◽  
Mei Hong Wu
Keyword(s):  
Epistemic Logic ◽  
Information Acquisition ◽  
Default Logic ◽  
Dynamic Epistemic Logic ◽  
Default Reasoning ◽  
Multi Agent Systems ◽  
Negotiation Strategy ◽  
Agent Systems ◽  
Multi Agent ◽  
Default Rules

In multi-agent systems, a number of autonomous pieces of software (the agents) interact in order to execute complex tasks. This paper proposes a logic framework portrays agent’s communication protocols in the multi-agent systems and a dynamic negotiation model based on epistemic default logic was introduced in this framework. In this paper, we use the constrained default rules to investigate the extension of dynamic epistemic logic, and constrained epistemic extension construct an efficient negotiation strategy via constrained epistemic default reasoning, which guarantees the important natures of extension existence and semi-monotonicity. We also specify characteristic of the dynamic updating when agent learn new knowledge in the logical framework. The method for the information sharing signify the usefulness of logical tools carried out in the dynamic process of information acquisition, and the distributed intelligent information processing show the effectiveness of reasoning default logic in the dynamic epistemic logic theory.

scholarly journals Multi-Agent Abstract Argumentation Frameworks With Incomplete Knowledge of Attacks

2021 ◽  
Author(s):  
Andreas Herzig ◽  
Antonio Yuste Ginel
Keyword(s):  
Epistemic Logic ◽  
Partial Information ◽  
Common Knowledge ◽  
Higher Order ◽  
Dynamic Epistemic Logic ◽  
Second Order ◽  
The State ◽  
Incomplete Knowledge ◽  
Abstract Argumentation ◽  
Multi Agent

We introduce a multi-agent, dynamic extension of abstract argumentation frameworks (AFs), strongly inspired by epistemic logic, where agents have only partial information about the conflicts between arguments. These frameworks can be used to model a variety of situations. For instance, those in which agents have bounded logical resources and therefore fail to spot some of the actual attacks, or those where some arguments are not explicitly and fully stated (enthymematic argumentation). Moreover, we include second-order knowledge and common knowledge of the attack relation in our structures (where the latter accounts for the state of the debate), so as to reason about different kinds of persuasion and about strategic features. This version of multi-agent AFs, as well as their updates with public announcements of attacks (more concretely, the effects of these updates on the acceptability of an argument) can be described using S5-PAL, a well-known dynamic-epistemic logic. We also discuss how to extend our proposal to capture arbitrary higher-order attitudes and uncertainty.

A cut-free labelled sequent calculus for dynamic epistemic logic

2020 ◽  
Vol 30 (1) ◽  
pp. 321-348
Author(s):  
Shoshin Nomura ◽  
Hiroakira Ono ◽  
Katsuhiko Sano
Keyword(s):  
Modal Logic ◽  
Epistemic Logic ◽  
Sequent Calculus ◽  
Dynamic Epistemic Logic ◽  
Kripke Semantics ◽  
Cut Rule ◽  
Public Announcement ◽  
Public Announcement Logic ◽  
Soundness And Completeness ◽  
Labelled Sequent Calculus

Abstract Dynamic epistemic logic is a logic that is aimed at formally expressing how a person’s knowledge changes. We provide a cut-free labelled sequent calculus ($\textbf{GDEL}$) on the background of existing studies of Hilbert-style axiomatization $\textbf{HDEL}$ of dynamic epistemic logic and labelled calculi for public announcement logic. We first show that the $cut$ rule is admissible in $\textbf{GDEL}$ and show that $\textbf{GDEL}$ is sound and complete for Kripke semantics. Moreover, we show that the basis of $\textbf{GDEL}$ is extended from modal logic K to other familiar modal logics including S5 with keeping the admissibility of cut, soundness and completeness.

scholarly journals POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION

2010 ◽  
Vol 3 (3) ◽  
pp. 351-373 ◽  
Author(s):  
MEHRNOOSH SADRZADEH ◽  
ROY DYCKHOFF
Keyword(s):  
Modal Logic ◽  
Multiagent Systems ◽  
Epistemic Logic ◽  
Proof Theory ◽  
Sequent Calculus ◽  
Dynamic Epistemic Logic ◽  
Algebraic Semantics ◽  
Sequent Calculi ◽  
Closure Operators ◽  
Positive Logic

We consider a simple modal logic whose nonmodal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4, and S5, such logics are useful, as shown in previous work by Baltag, Coecke, and the first author, for encoding and reasoning about information and misinformation in multiagent systems. For the propositional-only fragment of such a dynamic epistemic logic, we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of “nested” or “tree-sequent” calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario.

Topo-Logic as a Dynamic-Epistemic Logic

2017 ◽  
pp. 330-346 ◽  
Author(s):  
Alexandru Baltag ◽  
Aybüke Özgün ◽  
Ana Lucia Vargas Sandoval
Keyword(s):  
Epistemic Logic ◽  
Dynamic Epistemic Logic

scholarly journals The Dynamic Epistemic Logic for Actual Knowledge

2020 ◽  
Vol 49 (1) ◽  
Author(s):  
Arkadiusz Wójcik
Keyword(s):  
Epistemic Logic ◽  
Dynamic Epistemic Logic ◽  
Logical Omniscience ◽  
Actual Knowledge ◽  
Knowledge Change ◽  
The Past ◽  
Knowledge Models ◽  
Complete Axiomatization ◽  
New Information

The dynamic epistemic logic for actual knowledge models the phenomenon of actual knowledge change when new information is received. In contrast to the systems of dynamic epistemic logic which have been discussed in the past literature, our system is not burdened with the problem of logical omniscience, that is, an idealized assumption that the agent explicitly knows all classical tautologies and all logical consequences of his or her knowledge. We provide a sound and complete axiomatization for this logic.

scholarly journals Playing cards with Hintikka An introduction to dynamic epistemic logic

2005 ◽  
Vol 3 ◽  
Author(s):  
H. P. Ditmarsch ◽  
W. Van Der Hoek ◽  
B. P. Kooi
Keyword(s):  
Epistemic Logic ◽  
Common Knowledge ◽  
Dynamic Epistemic Logic ◽  
Knowledge And Beliefs ◽  
Public Announcements

This contribution is a gentle introduction to so-called dynamic epistemic logics, that can describe how agents change their knowledge and beliefs. We start with a concise introduction to epistemic logic, through the example of one, two and finally three players holding cards; and, mainly for the purpose of motivating the dynamics, we also very summarily introduce the concepts of general and common knowledge. We then pay ample attention to the logic of public announcements, wherein agents change their knowledge as the result of public announcements. One crucial topic in that setting is that of unsuccessful updates: formulas that become false when announced. The Moore-sentences that were already extensively discussed at the conception of epistemic logic in Hintikka’s ‘Knowledge and Belief ’ (1962) give rise to such unsuccessful updates. After that, we present a few examples of more complex epistemic updates.

Sign in / Sign up

Export Citation Format

Share Document