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.

Consistent Extension of Dynamic Knowledge Updating in the Multi-Agent System

2011 ◽  
Vol 267 ◽  
pp. 599-604
Author(s):  
Mei Hong Wu
Keyword(s):  
Default Logic ◽  
Default Reasoning ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent System ◽  
Agent Systems ◽  
Consistent Extension ◽  
Knowledge Updating ◽  
Multi Agent ◽  
Communication Policies

In this paper we explore the use of dynamic epistemic default logic to offer a natural way of communication policies for the management of inter-agent exchanges in the multi-agent systems. We firstly focus on the acquisition of the extension in the dynamic epistemic theory based multi-agent system when its background set absorbing new information constantly, then we add the constrained default sets to restrict the agent's inference behavior and manage to obtain the extension of constrained epistemic default logic theory via default reasoning. We also discuss the characteristic of the dynamic updating when agent meets incompatible knowledge in the logical framework of multi-agent systems and finally we proved the related theorem for knowledge updating.

scholarly journals Model Checking Temporal Epistemic Logic under Bounded Recall

2020 ◽  
Vol 34 (05) ◽  
pp. 7071-7078
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Emily Yu
Keyword(s):  
Model Checking ◽  
Incomplete Information ◽  
Epistemic Logic ◽  
Upper Bounds ◽  
Experimental Results ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Bounded Recall

We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.

scholarly journals Possession as Linear Knowledge

10.29007/ntkm ◽  
2018 ◽  
Author(s):  
Frank Pfenning
Keyword(s):  
Distributed System ◽  
Epistemic Logic ◽  
Linear Logic ◽  
Expressive Power ◽  
Cut Elimination ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Ongoing Effort ◽  
Multi Agent ◽  
Localized Knowledge

Epistemic logic analyzes reasoning governing localized knowledge, and is thus fundamental to multi- agent systems. Linear logic treats hypotheses as consumable resources, allowing us to model evolution of state. Combining principles from these two separate traditions into a single coherent logic allows us to represent localized consumable resources and their flow in a distributed system. The slogan “possession is linear knowledge” summarizes the underlying idea. We walk through the design of a linear epistemic logic and discuss its basic metatheoretic properties such as cut elimination. We illustrate its expressive power with several examples drawn from an ongoing effort to design and implement a linear epistemic logic programming language for multi-agent distributed systems.

scholarly journals A HYBRID MODEL FOR SHARING INFORMATION BETWEEN FUZZY, UNCERTAIN AND DEFAULT REASONING MODELS IN MULTI-AGENT SYSTEMS

2002 ◽  
Vol 10 (04) ◽  
pp. 401-450 ◽  
Author(s):  
XUDONG LUO ◽  
CHENGQI ZHANG ◽  
NICHOLAS R. JENNINGS
Keyword(s):  
Hybrid Model ◽  
Approximate Reasoning ◽  
Default Reasoning ◽  
Uncertain Reasoning ◽  
Uncertain Information ◽  
Multi Agent Systems ◽  
Unified Framework ◽  
Agent Systems ◽  
Special Cases ◽  
Multi Agent

This paper develops a hybrid model which provides a unified framework for the following four kinds of reasoning: 1) Zadeh's fuzzy approximate reasoning; 2) truth-qualification uncertain reasoning with respect to fuzzy propositions; 3) fuzzy default reasoning (proposed, in this paper, as an extension of Reiter's default reasoning); and 4) truth-qualification uncertain default reasoning associated with fuzzy statements (developed in this paper to enrich fuzzy default reasoning with uncertain information). Our hybrid model has the following characteristics: 1) basic uncertainty is estimated in terms of words or phrases in natural language and basic propositions are fuzzy; 2) uncertainty, linguistically expressed, can be handled in default reasoning; and 3) the four kinds of reasoning models mentioned above and their combination models will be the special cases of our hybrid model. Moreover, our model allows the reasoning to be performed in the case in which the information is fuzzy, uncertain and partial. More importantly, the problems of sharing the information among heterogeneous fuzzy, uncertain and default reasoning models can be solved efficiently by using our model. Given this, our framework can be used as a basis for information sharing and exchange in knowledge-based multi-agent systems for practical applications such as automated group negotiations. Actually, to build such a foundation is the motivation of this paper.

scholarly journals Symbolic Synthesis of Fault-Tolerance Ratios in Parameterised Multi-Agent Systems

2018 ◽  
Author(s):  
Panagiotis Kouvaros ◽  
Alessio Lomuscio ◽  
Edoardo Pirovano
Keyword(s):  
Fault Tolerance ◽  
Epistemic Logic ◽  
Swarm Robotics ◽  
Experimental Results ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent System ◽  
Agent Systems ◽  
Multi Agent ◽  
Symbolic Synthesis

We study the problem of determining the robustness of a multi-agent system of unbounded size against specifications expressed in a temporal-epistemic logic. We introduce a procedure to synthesise automatically the maximal ratio of faulty agents that may be present at runtime for a specification to be satisfied in a multi-agent system. We show the procedure to be sound and amenable to symbolic implementation. We present an implementation and report the experimental results obtained by running this on a number of protocols from swarm robotics.

Sign in / Sign up

Export Citation Format

Share Document