Variable Forgetting in Reasoning about Knowledge

01/15/2014
by   Kaile Su, et al.
0

In this paper, we investigate knowledge reasoning within a simple framework called knowledge structure. We use variable forgetting as a basic operation for one agent to reason about its own or other agents knowledge. In our framework, two notions namely agents observable variables and the weakest sufficient condition play important roles in knowledge reasoning. Given a background knowledge base and a set of observable variables for each agent, we show that the notion of an agent knowing a formula can be defined as a weakest sufficient condition of the formula under background knowledge base. Moreover, we show how to capture the notion of common knowledge by using a generalized notion of weakest sufficient condition. Also, we show that public announcement operator can be conveniently dealt with via our notion of knowledge structure. Further, we explore the computational complexity of the problem whether an epistemic formula is realized in a knowledge structure. In the general case, this problem is PSPACE-hard; however, for some interesting subcases, it can be reduced to co-NP. Finally, we discuss possible applications of our framework in some interesting domains such as the automated analysis of the well-known muddy children puzzle and the verification of the revised Needham-Schroeder protocol. We believe that there are many scenarios where the natural presentation of the available information about knowledge is under the form of a knowledge structure. What makes it valuable compared with the corresponding multi-agent S5 Kripke structure is that it can be much more succinct.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2020

Subjective Knowledge and Reasoning about Agents in Multi-Agent Systems

Though a lot of work in multi-agent systems is focused on reasoning abou...
research
06/22/2011

Propositional Independence - Formula-Variable Independence and Forgetting

Independence -- the study of what is relevant to a given problem of reas...
research
06/05/2023

Mathematical Foundations for Joining Only Knowing and Common Knowledge (Extended Version)

Common knowledge and only knowing capture two intuitive and natural noti...
research
10/01/2020

Multi-Agent Systems based on Contextual Defeasible Logic considering Focus

In this paper, we extend previous work on distributed reasoning using Co...
research
03/13/2020

On Sufficient and Necessary Conditions in Bounded CTL

Computation Tree Logic (CTL) is one of the central formalisms in formal ...
research
01/12/2020

Commonly Knowingly Whether

This paper introduces `commonly knowing whether', a non-standard version...
research
02/13/2022

Reduced-Form Allocations with Complementarity: A 2-Person Case

We investigate the implementation of reduced-form allocation probabiliti...

Please sign up or login with your details

Forgot password? Click here to reset