Multi-agent dynamic-epistemic logic

Author(s):  
Johan van Benthem
2013 ◽  
Vol 651 ◽  
pp. 943-948
Author(s):  
Zhi Ling Hong ◽  
Mei Hong Wu

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.


Author(s):  
Andreas Herzig ◽  
Antonio Yuste Ginel

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.


2011 ◽  
Vol 4 (4) ◽  
pp. 536-559 ◽  
Author(s):  
BARTELD KOOI ◽  
BRYAN RENNE

We presentArrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing “arrow updates” of Arrow Update Logic can be transformed into equivalent belief-changing “action models” from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logic’s perspective of eliminating access to epistemic possibilities, Arrow Update Logic is a valuable addition to the repertoire of logics of information change. In addition to proving basic results about Arrow Update Logic, we introduce a new notion of common knowledge that generalizes both ordinary common knowledge and the “relativized” common knowledge familiar from the Dynamic Epistemic Logic literature.


Synthese ◽  
2021 ◽  
Author(s):  
Carlo Proietti ◽  
Antonio Yuste-Ginel

AbstractThis paper introduces a multi-agent dynamic epistemic logic for abstract argumentation. Its main motivation is to build a general framework for modelling the dynamics of a debate, which entails reasoning about goals, beliefs, as well as policies of communication and information update by the participants. After locating our proposal and introducing the relevant tools from abstract argumentation, we proceed to build a three-tiered logical approach. At the first level, we use the language of propositional logic to encode states of a multi-agent debate. This language allows to specify which arguments any agent is aware of, as well as their subjective justification status. We then extend our language and semantics to that of epistemic logic, in order to model individuals’ beliefs about the state of the debate, which includes uncertainty about the information available to others. As a third step, we introduce a framework of dynamic epistemic logic and its semantics, which is essentially based on so-called event models with factual change. We provide completeness results for a number of systems and show how existing formalisms for argumentation dynamics and unquantified uncertainty can be reduced to their semantics. The resulting framework allows reasoning about subtle epistemic and argumentative updates—such as the effects of different levels of trust in a source—and more in general about the epistemic dimensions of strategic communication.


Author(s):  
Andrés Occhipinti Liberman ◽  
Rasmus Kræmmer Rendsvig

Propositional Dynamic Epistemic Logic (DEL) provides an expressive framework for epistemic planning, but lacks desirable features that are standard in first-order planning languages (such as problem-independent action representations via action schemas). A recent epistemic planning formalism based on First-Order Dynamic Epistemic Logic (FODEL) combines the strengths of DEL (higher-order epistemics) with those of first-order languages (lifted representation), yielding benefits in terms of expressiveness and representational succinctness. This paper studies the plan existence problem for FODEL planning, showing that while the problem is generally undecidable, the cases of single-agent planning and multi-agent planning with non-modal preconditions are decidable.


Author(s):  
Thorsten Engesser ◽  
Robert Mattmüller ◽  
Bernhard Nebel ◽  
Michael Thielscher

Several different frameworks have been proposed to model and reason about knowledge in dynamic multi-agent settings, among them the logic-programming-based game description language GDL-III, and dynamic epistemic logic (DEL), based on possible-worlds semantics. GDL-III and DEL have complementary strengths and weaknesses in terms of ease of modeling and simplicity of semantics. In this paper, we formally study the expressiveness of GDL-III vs. DEL. We clarify the commonalities and differences between those languages, demonstrate how to bridge the differences where possible, and identify large fragments of GDL-III and DEL that are equivalent in the sense that they can be used to encode games or planning tasks that admit the same legal action sequences. We prove the latter by providing compilations between those fragments of GDL-III and DEL.


Author(s):  
Alexandru Baltag ◽  
Aybüke Özgün ◽  
Ana Lucia Vargas Sandoval

2020 ◽  
Vol 49 (1) ◽  
Author(s):  
Arkadiusz Wójcik

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.


Sign in / Sign up

Export Citation Format

Share Document