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.

scholarly journals ARROW UPDATE LOGIC

2011 ◽  
Vol 4 (4) ◽  
pp. 536-559 ◽  
Author(s):  
BARTELD KOOI ◽  
BRYAN RENNE
Keyword(s):  
Epistemic Logic ◽  
Belief Change ◽  
Common Knowledge ◽  
Dynamic Epistemic Logic ◽  
Epistemic Access ◽  
Multi Agent ◽  
Logic Approach ◽  
Action Models ◽  
Information Change ◽  
Update Logic

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.

scholarly journals Dynamic epistemic logics for abstract argumentation

Synthese ◽  
2021 ◽  
Author(s):  
Carlo Proietti ◽  
Antonio Yuste-Ginel
Keyword(s):  
Epistemic Logic ◽  
Propositional Logic ◽  
General Framework ◽  
Strategic Communication ◽  
Dynamic Epistemic Logic ◽  
Abstract Argumentation ◽  
Information Update ◽  
Multi Agent ◽  
Event Models ◽  
Different Levels

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.

scholarly journals Decidability Results in First-Order Epistemic Planning

2020 ◽  
Author(s):  
Andrés Occhipinti Liberman ◽  
Rasmus Kræmmer Rendsvig
Keyword(s):  
Epistemic Logic ◽  
Single Agent ◽  
Higher Order ◽  
Dynamic Epistemic Logic ◽  
Existence Problem ◽  
Independent Action ◽  
First Order ◽  
Multi Agent ◽  
Action Representations ◽  
Multi Agent Planning

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.

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.

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 A General Multi-agent Epistemic Planner Based on Higher-order Belief Change

2017 ◽  
Author(s):  
Xiao Huang ◽  
Biqing Fang ◽  
Hai Wan ◽  
Yongmei Liu
Keyword(s):  
Normal Form ◽  
Belief Change ◽  
Common Knowledge ◽  
Dynamic Logic ◽  
Higher Order ◽  
Experimental Results ◽  
General Representation ◽  
Multi Agent ◽  
Representation Language ◽  
Contingent Planning

In recent years, multi-agent epistemic planning has received attention from both dynamic logic and planning communities. Existing implementations of multi-agent epistemic planning are based on compilation into classical planning and suffer from various limitations, such as generating only linear plans, restriction to public actions, and incapability to handle disjunctive beliefs. In this paper, we propose a general representation language for multi-agent epistemic planning where the initial KB and the goal, the preconditions and effects of actions can be arbitrary multi-agent epistemic formulas, and the solution is an action tree branching on sensing results.To support efficient reasoning in the multi-agent KD45 logic, we make use of a normal form called alternative cover disjunctive formula (ACDF). We propose basic revision and update algorithms for ACDF formulas. We also handle static propositional common knowledge, which we call constraints. Based on our reasoning, revision and update algorithms, adapting the PrAO algorithm for contingent planning from the literature, we implemented a multi-agent epistemic planner called MAEP. Our experimental results show the viability of our approach.

scholarly journals THE EXPRESSIVITY OF FACTUAL CHANGE IN DYNAMIC EPISTEMIC LOGIC

2013 ◽  
Vol 7 (2) ◽  
pp. 208-221 ◽  
Author(s):  
LOUWE B. KUIJER
Keyword(s):  
Epistemic Logic ◽  
Common Knowledge ◽  
Dynamic Epistemic Logic ◽  
Public Announcements

AbstractA commonly used dynamic epistemic logic is one obtained by adding commonknowledge and public announcements to a basic epistemic logic. It is known from Kooi (2007) that adding public substitutions to such a logic adds expressivity over the class K of models. Here I show that substitutions also add expressivity over the classes KD45, S4 and S5 of models. Since the combination of common knowledge, public announcements and substitutions, was shown in Kooi (2007) to be equally expressive to relativized common knowledge these results also show that relativized common knowledge is more expressive than common knowledge and public announcements over KD45, S4 and S5. These results therefore extend the result from van Benthem et al. (2006) that shows that relativized common knowledge is more expressive than common knowledge and public announcements over K.

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.

DISTURBANCE STRESS FOR STABILIZED SECOND ORDER CONTROL SYSTEMS

1998 ◽  
Vol 08 (07) ◽  
pp. 1155-1182 ◽  
Author(s):  
E. B. LEE ◽  
J. C. LUO
Keyword(s):  
Control Systems ◽  
Higher Order ◽  
Second Order ◽  
The State ◽  
Feedback Form ◽  
Switching Curve ◽  
Time Distance ◽  
Quadratic Index ◽  
Bounded Disturbance

It is shown that the nastiest bounded disturbance stress for the stable second order oscillator is bang–bang with switching set by the state. A quadratic index and a time-distance index are used to evaluate the severity of the stressing. A procedure is suggested to construct a switching curve which synthesizes the disturbance stress in feedback form. Examples illustrating the results and the possible extension to third and higher order systems are given.

scholarly journals Relativized common knowledge for dynamic epistemic logic

2015 ◽  
Vol 13 (3) ◽  
pp. 370-393 ◽  
Author(s):  
Yì N. Wáng ◽  
Thomas Ågotnes
Keyword(s):  
Epistemic Logic ◽  
Common Knowledge ◽  
Dynamic Epistemic Logic
Sign in / Sign up

Export Citation Format

Share Document