Related papers: Axiomatisation for an asynchronous epistemic logic…
We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the…
We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various parameters. All the logics considered involve the discrete…
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and…
We propose communication pattern logic. A communication pattern describes how processes or agents inform each other, independently of the information content. The full-information protocol in distributed computing is the special case…
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and…
It plays a central role in intelligent agent systems to model agent's epistemic state and its change. Asynchrony plays a key role in distributed systems, in which the messages transmitted may not be received instantly by the agents. To…
In this contribution we present arbitrary arrow update model logic (AAUML). This is a dynamic epistemic logic or update logic. In update logics, static/basic modalities are interpreted on a given relational model whereas dynamic/update…
Arbitrary public announcement logic (APAL) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public…
This paper first shows that the popular axiomatic systems proposed by Nute for Lewis' conditional logics are not equivalent to Lewis' original systems. In particular, the axiom CA which is derivable in Lewis' systems is not derivable in…
The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…
Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms…
In this paper we consider the modal logic with both Box and Diamond arising fromKripke models with a crisp accessibility and whose propositions are valued over the stan-dard Godel algebra [0,1]G. We provide an axiomatic system extending the…
Categorization systems are widely studied in psychology, sociology, and organization theory as information-structuring devices which are critical to decision-making processes. In the present paper, we introduce a sound and complete…
Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as "knowing whether", "knowing what", "knowing how" are frequently and widely used in everyday life as well as academic fields. In…
Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In…
In this paper, we address the logic of knowing why, an example of a non-standard epistemic logic dealing with justified knowledge via a new epistemic operator, under the extensions with ideas from dynamic epistemic logic, namely public…
Epistemic analysis of distributed systems is one of the biggest successes among applications of logic in computer science. The reason for that is that agents' actions are necessarily guided by their knowledge. Thus, epistemic modal logic,…
In recent years, epistemic logics have been extended with operators K_ax for knowledge of (the value of) a variable x (by an agent a). We study dynamic versions of these logics, enriched with modalities for semi-public data-exchange events…
We give some semantic results for an epistemic logic incorporating dynamic operators to describe information changing events. Such events include epistemic changes, where agents become more informed about the non-changing state of the…