An Epistemic Logic for Multi-agent Systems with Budget and Costs

2021 ◽  
pp. 101-115
Author(s):  
Stefania Costantini ◽  
Andrea Formisano ◽  
Valentina Pitoni
Keyword(s):  
Epistemic Logic ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

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.

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 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.

scholarly journals Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results

2012 ◽  
Vol 45 ◽  
pp. 1-45 ◽  
Author(s):  
F. Belardinelli ◽  
A. Lomuscio
Keyword(s):  
Epistemic Logic ◽  
Order Logic ◽  
First Order Logic ◽  
Multi Agent Systems ◽  
Perfect Recall ◽  
Initial State ◽  
Agent Systems ◽  
First Order ◽  
Multi Agent ◽  
Order Extension

We investigate a class of first-order temporal-epistemic logics for reasoning about multi-agent systems. We encode typical properties of systems including perfect recall, synchronicity, no learning, and having a unique initial state in terms of variants of quantified interpreted systems, a first-order extension of interpreted systems. We identify several monodic fragments of first-order temporal-epistemic logic and show their completeness with respect to their corresponding classes of quantified interpreted systems.

Design of an Intelligent System to Support Tutors in Learning Communities Using Multi-Agent Systems and Fuzzy Logic

2015 ◽  
Vol 10 (8) ◽  
pp. 845 ◽  
Author(s):  
Youness Chaabi ◽  
R. Messoussi ◽  
V. Hilaire ◽  
Y. Ruichek ◽  
K. Lekdioui ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Learning Communities ◽  
Intelligent System ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent
Sign in / Sign up

Export Citation Format

Share Document