scholarly journals Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge

2008 ◽  
Author(s):  
Valentin Goranko ◽  
Dmitry Shkatov
Keyword(s):  
Epistemic Logic ◽  
Decision Procedure ◽  
Distributed Knowledge ◽  
Multi Agent

scholarly journals Learning What Others Know

10.29007/plm4 ◽  
2020 ◽  
Author(s):  
Alexandru Baltag ◽  
Sonja Smets
Keyword(s):  
Information Sharing ◽  
Epistemic Logic ◽  
Common Knowledge ◽  
The Other ◽  
Distributed Knowledge ◽  
Multi Agent ◽  
Information Database

We propose a number of powerful dynamic-epistemic logics for multi-agent information sharing and acts of publicly or privately accessing other agents’ information databases. The static base of our logics is obtained by adding to standard epistemic logic comparative epistemic assertions for groups or individuals, as well as a common distributed knowledge operator (that combines features of both common knowledge and distributed knowledge). On the dynamic side, we introduce actions by which epistemic superiority can be acquired: “sharing all one knows” (by e.g. giving access to one’s information database to all or some of the other agents), as well as more complex informational events, such as hacking. We completely axiomatize several such logics and prove their decidability.

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.

Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents

2012 ◽  
pp. 32-46
Author(s):  
V. Rybakov
Keyword(s):  
Normal Form ◽  
Temporal Logic ◽  
Decision Procedure ◽  
Linear Temporal Logic ◽  
Satisfiability Problem ◽  
Global Knowledge ◽  
Interacting Agents ◽  
Logical Operations ◽  
Multi Agent ◽  
Bounded Size

Our paper studies a logic UIALTL, which is a combination of the linear temporal logic LTL, a multi-agent logic with operation for passing knowledge via agents’ interaction, and a suggested logic based on operation of logical uncertainty. The logical operations of UIALTL also include (together with operations from LTL) operations of strong and weak until, agents’ knowledge operations, operation of knowledge via interaction, operation of logical uncertainty, the operations for environmental and global knowledge. UIALTL is defined as a set of all formulas valid at all Kripke-Hintikka like models NC. Any frame NC represents possible unbounded (in time) computation with multi-processors (parallel computational units) and agents’ channels for connections between computational units. The main aim of our paper is to determine possible ways for computation logical laws of UIALTL. Principal problems we are dealing with are decidability and the satisfiability problems for UIALTL. We find an algorithm which recognizes theorems of UIALTL (so we show that UIALTL is decidable) and solves satisfiability problem for UIALTL. As an instrument we use reduction of formulas to rules in the reduced normal form and a technique to contract models NC to special non-UIALTL-models, and, then, verification of validity these rules in models of bounded size. The paper uses standard results from non-classical logics based on Kripke-Hintikka models.

An Ontological Approach to Managing Project Memories in Organizations

2011 ◽  
pp. 233-261 ◽  
Author(s):  
Davy Monticolo ◽  
Vincent Hilaire ◽  
Samuel Gomes ◽  
Abderrafiaa Koukam
Keyword(s):  
Mechanical Design ◽  
Domain Ontology ◽  
Organizational Memory ◽  
Knowledge Modeling ◽  
Distributed Knowledge ◽  
Agent Model ◽  
Professional Activities ◽  
Ontological Approach ◽  
Multi Agent

Knowledge Management (KM) is considered by many organizations a key aspect in sustaining competitive advantage. In the mechanical design domain, the KM facilitates the design of routine product and brings a saving time for innovation. This chapter describes the specification of a project memory as an organizational memory to specify knowledge to capitalize all along project in order to be reuse. Afterwards it presents the design of a domain ontology and a multi agent system to manage project memories all along professional activities. As a matter of fact, these activities require that engineers, with different specialities, collaborate to carry out the same goal. Inside professional activities; they use their knowhow and knowledge in order to achieve the laid down goals. The professional actors competences and knowledge modeling allows the design and the description of agents’ know-how. Furthermore, the paper describes the design of our agent model based on an organisational approach and the role of a domain ontology called OntoDesign to manage heterogeneous and distributed knowledge.

scholarly journals EVERYONE KNOWS THAT SOMEONE KNOWS: QUANTIFIERS OVER EPISTEMIC AGENTS

2019 ◽  
Vol 12 (2) ◽  
pp. 255-270 ◽  
Author(s):  
PAVEL NAUMOV ◽  
JIA TAO
Keyword(s):  
Modal Logic ◽  
Epistemic Logic ◽  
Possible Worlds ◽  
Completeness Theorem ◽  
Kripke Semantics ◽  
Possible Worlds Semantics ◽  
Distributed Knowledge ◽  
First Order ◽  
Soundness And Completeness ◽  
First Order Modal Logic

AbstractModal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the first-order modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging over the set of agents, and proves its soundness and completeness with respect to a Kripke semantics.

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.

Sign in / Sign up

Export Citation Format

Share Document