Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T23:24:35.534Z Has data issue: false hasContentIssue false

A public announcement separation logic

Published online by Cambridge University Press:  15 April 2019

J.R. Courtault
Affiliation:
Université de Lorraine, CNRS, LORIA, UMR 7503, Vandoeuvre-lès-Nancy, F-54506, France
H. van Ditmarsch
Affiliation:
Université de Lorraine, CNRS, LORIA, UMR 7503, Vandoeuvre-lès-Nancy, F-54506, France
D. Galmiche*
Affiliation:
Université de Lorraine, CNRS, LORIA, UMR 7503, Vandoeuvre-lès-Nancy, F-54506, France
*
*Corresponding author. Email: Didier.Galmiche@loria.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We define a Public Announcement Separation Logic (PASL) that allows us to consider epistemic possible worlds as resources that can be shared or separated, in the spirit of separation logics. After studying its semantics and illustrating its interest for modelling systems, we provide a sound and complete tableau calculus that deals with resource, agent and announcement constraints and give also a countermodel extraction method.

Information

Type
Paper
Copyright
© Cambridge University Press 2019