Abstract

We introduce Normative Temporal Logic (NTL), a logic for reasoning about normative systems. NTL is a generalisation of the well-known branchingtime temporal logic CTL, in which the path quantifiers A (“on all paths... ”) and E (“on some path... ”) are replaced by the indexed deontic operators Oη and Pη, where for example Oηϕ means “ϕ is obligatory in the context of normative system η”. After defining the logic, we give a sound and complete axiomatisation, and discuss the logic’s relationship to standard deontic logics. We present a symbolic representation language for models and normative systems, and identify four different model checking problems, corresponding to whether or not a model is represented symbolically or explicitly, and whether or not we are given an interpretation for the normative systems named in formulae to be checked. We show that the complexity of model checking varies from P-complete up to EXPTIME-hard for these variations. 1

Citations