WestminsterResearch

Combining computation tree logic and deontic logic in natural deduction style calculus

Bolotov, Alexander and Grigoriev, Oleg (2009) Combining computation tree logic and deontic logic in natural deduction style calculus. Technical Report. University of Westminster.

Full text not available from this repository.

Official URL: http://sites.westminster.ac.uk/bolotoa/PROVER/deontic-ctl-...

Abstract

In this technical report we present a natural deduction calculus for branching-time deontic logic, a combination of the branching-time logic CTL and deontic modalities and prove its correctness. The new proof technique can be applied as a reasoning tool in modeling dynamic normative systems, for example, social organisations. From the methodological point of view our approach allows to obtain similar proof systems for other modal extensions of CTL by simple modification of the part of the system that corresponds to the properties of modalities.

Item Type:Monograph (Technical Report)
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:7341
Deposited On:25 Jan 2010 15:38
Last Modified:25 Jan 2010 15:38

Repository Staff Only: item control page