An axiomatic basis for computer programming
Communications of the ACM
Towards metalogical systematisation of deontic action logics based on Boolean algebra
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
| Hi-index | 0.00 |
We start our investigations from the deontic action model defined in multi-situation settings. Then we discuss the validity of formulas constructed in a language with a finite number of basic actions, parallel and sequential compositions of actions, a free choice operator and the standard deontic operators of obligation, strong permission and prohibition. The main achievements of the paper are definitions of metalogical counterparts of deontic operators and interpretation function of actions taking into account their terminating and non-terminating executions.