Resource separation in dynamic logic of propositional assignments

04/30/2021
by   Joseph Boudou, et al.
0

We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction axioms, thereby establishing decidability. We also prove that the complexity of both the model checking and the satisfiability problem stay in PSPACE.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/09/2014

Tableaux for Dynamic Logic of Propositional Assignments

The Dynamic Logic for Propositional Assignments (DL-PA) has recently bee...
10/12/2018

The Effects of Adding Reachability Predicates in Propositional Separation Logic

The list segment predicate ls used in separation logic for verifying pro...
10/23/2019

Propositional Dynamic Logic for Hyperproperties

Information security properties of reactive systems like non-interferenc...
04/27/2021

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?

Adding propositional quantification to the modal logics K, T or S4 is kn...
11/01/2019

On the construction of multi-valued concurrent dynamic logic

Dynamic logic is a powerful framework for reasoning about imperative pro...
12/10/2021

Logical Boltzmann Machines

The idea of representing symbolic knowledge in connectionist systems has...
06/17/2011

On the expressive power of unit resolution

This preliminary report addresses the expressive power of unit resolutio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.