Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen

24.01.2017 | Foundations | Ausgabe 3/2018 Open Access

Soft Computing 3/2018

Deontic STIT logic, from logical paradox to security policy

Soft Computing > Ausgabe 3/2018
Lirong Qiu, Xin Sun
Wichtige Hinweise
Communicated by A. Di Nola.
This paper is a revision of Sun and Baniasadi (2014).

1 Introduction

Our ultimate goal in this article is to develop a logic to formalize security policies, especially for intrude detection in pervasive computing environments. Security is a high priority requirement for lots of information systems, and it is considered in practice as a more and more significant issue. In most systems, security requirements may already exist but usually remain informal, and starting from these requirements it is of growing interest to be able to define a rigorous security policy.
In pervasive computing environments, resources like information and services are accessible anywhere and anytime via any devices (Barolli and Takizawa 2010; Marcelloni et al. 2014; Ogiela et al. 2014; Ramos et al. 2014; Choi et al. 2014). There are different sorts of users and services, and some of them may be unknown or not predefined (Kagal et al. 2001). The distribution of resources in these environments forces us to leverage decentralized security management. In this setting, the environment is divided into a number of domains based on different factors. For each domain, there is a security agent with an administrator (we call it authority) who is responsible for preserving the security of resources that are under their protection.
Several authors have used deontic logic to specify security policies (Glasgow et al. 1992; Jones and Sergot 1992; Demolombe and Jones 1996; Cuppens-Boulahia and Cuppens 2008; Cuppens et al. 2013). These authors outlined the main features of this formalism to analyze further various aspects of security, to formalize previously informal security requirements and to provide a flexible and expressive language for specifying security properties. Deontic logic is a formal study of norms and deontic modalities (such as permission, forbidden and obligation). In 1951, the publication of von Wright ( 1951) indicates the birth of deontic logic. With the work of Meyer ( 1988), deontic logic became a part of computer science. Deontic logic has been a valuable tool in the specification and reasoning of security policies because key notions in security such as permission, authorization, prohibition and obligation are exactly the subjects of deontic logic. To apply deontic logic in the specification of security policies in pervasive computing environments, we need a deontic logic in which different authorities are explicitly modeled. Deontic STIT logic offers one option for this purpose. Deontic STIT logic (Horty 2001; Kooi and Tamminga 2008; Sun 2011; Broersen 2011), grounded on STIT (see to it that) theory (Belnap et al. 2001), is a branch of deontic logic developed by philosophers, logicians and computer scientists in recent years. In Kooi and Tamminga ( 2008) and Sun ( 2011), the authors develop deontic logics which are capable of models commands from different authorities.
Another reason for choosing deontic STIT logic comes from the motivation of the specification of policies of intrusion detection. Cuppens-Boulahia and Cuppens ( 2008) investigate the specification of intrusion detection policies. They argue that it is appropriate to use the bring it about modality for specification. Since the difference between bring it about and see to it that is negligible, deontic STIT logic can be an appropriate tool to specify policies of intrusion detection.
From a logical perspective, one limitation of the existing deontic STIT logic is that they are suffered from some logical paradoxes. This paper develops a new multi-authority deontic STIT logic (MADL) to overcome this problem such that our logic is more suitable for the application to security than the existing deontic STIT logics.
In the rest of this paper, we recap the miners paradox in Sect.  2 as a trigger of our further study. We then present our deontic STIT logic in Sect.  3. In Sect.  4 we discuss some related work. Section  5 summarizes this article with future work.

2 The miners paradox

In recent years, many deontic logicians get interested in the miners paradox (Gabbay et al. 2014). The miners paradox presented in Kolodny and MacFarlane ( 2010) is described like this:
There are 10 miners trapped in either shaft A or shaft B, but we don’t know which one. Water threatens to flood the shafts. We have sandbags to block only one shaft. If one shaft is blocked, all water will flood into the other shaft, killing all miners inside. If we block neither shaft, both will be flooded partially, killing 1 miner.
Since we don’t know the miners’ location, it seems plausible that:
We should block neither shaft A nor shaft B.
However, the following also seems acceptable.
We should block shaft A if the miners are in shaft A.
We should block shaft B if the miners are in shaft B.
The miners are either in shaft A or in shaft B.
And (2), (3) together with (4) imply that
Either we should block shaft A or we should block shaft B.
Which contradicts to (1).
The deontic STIT logic proposed in Horty ( 2001), Kooi and Tamminga ( 2008), Sun ( 2011) cannot solve this paradox: Although the inference from (2)–(4) to (5) is not valid in the logic introduced in Sun ( 2011), both Horty ( 2001) and Sun ( 2011) are not capable of predicting (1). In this paper, we develop MADL, which is able to block the inference from (2)–(4) to (5) meanwhile predicts (1)–(4).

3 Deontic STIT logic

In deontic STIT logic, the semantics of deontic operator is interpreted by best choices, which are defined via a preference relation over sets of possible worlds. Such a relation is characterized by a preference relation over possible worlds through lifting. In the literature, there are many methods of lifting preference, which are summarized by Lang and van der Torre ( 2008) as follows:
  • strong lifting: Let \(U_1\) and \( U_2\) be two sets of worlds, \(U_1\) is strongly at least as good as \( U_2\) iff \(\forall w\in U_1\), \(\forall v\in U_2\), w is at least as good as v.
  • optimistic lifting: \(U_1\) is optimistically at least as good as \( U_2\) iff \(\exists w\in U_1\), \(\forall v\in U_2\), w is at least as good as v.
  • pessimistic lifting: \(U_1\) pessimistically at least as good as \( U_2\) iff \(\forall w\in U_1\), \(\exists v\in U_2\), w is at least as good as v.
In utilitarian deontic logic (UDL) of Horty ( 2001), Kooi and Tamminga ( 2008), Sun ( 2011), strong lifting is used. According to strong lifting, the best choices in the miners paradox are \({\textit{block}}\_ A\), \({\textit{block}}\_ B\) and \({\textit{block}}\_{\textit{neither}}\). Therefore, “we ought to block neither” is false. To have a more precise understanding of such reasoning, we now formally review the UDL introduced in Sun ( 2011).
The language of utilitarian deontic logic, \(\mathfrak {L}_{udl}\), is defined by the following BNF: Let \({\varPsi }=\{p,q,r,\ldots \}\) be a set of propositional atoms and \(Agent=\{1,\ldots ,n\}\) be a set of agents,
$$\begin{aligned} \psi {::=} p \mid \lnot \psi \mid \psi \wedge \psi \mid \bigcirc _{G}\psi \mid \bigcirc _{G}(\psi /\psi ) \mid [G]\psi \end{aligned}$$
where \(p\in {\varPsi }, G\subseteq Agent\). Intuitively, \([G]\psi \) says that “group G sees to it that \(\psi \).” \(\bigcirc _{G}\psi \) says that “ G ought to see to it that \(\psi \).” \(\bigcirc _{G}(\psi /\phi )\) says that “ G ought to see to it that \(\psi \) under the condition \(\phi \).” The semantics of UDL is defined via the notion of utilitarian models.
Definition 1
A utilitarian model \(( W,V, Choice, \preceq )\) is a tuple where W is a set of possible worlds, V is a valuation function that maps every atom to a set of worlds, \(\preceq \) is a transitive and reflexive relation over W, Choice is a choice function. The function \(Choice: 2^{Agent}\mapsto 2^{2^{W}}\) is based on the individual choice function IndChoice: Agent \(\mapsto \) \(2^{2^{W}}\). IndChoice is required to satisfy the following conditions:
IndChoice( i) forms a partition of W, for every \(i\in Agent\);
given arbitrary \(x_{1}\in IndChoice(1), \ldots , x_{n}\in IndChoice(n)\) and \(Agent=\{1,\ldots ,n\}\), it holds that \(x_{1}\cap \cdots \cap x_{n}\ne \emptyset \);
A selection function \(\tau \): \(Agent \mapsto 2^{W}\) is a function such that for all \(i\in Agent\), it holds that \(\tau (i)\in IndChoice(i)\). For \(H\subseteq Agent\), if \(H\ne \emptyset \), then we let \(Choice(H)=\{\bigcap _{j\in H}\tau (j):\tau \text{ is } \text{ a } \text{ selection } \text{ function }\}\). If \(H=\emptyset \), then \(Choice(H)=\{W\}\).
We use \(w\preceq v\) to represent that w is no better than v and \(w\approx v\) as an abbreviation of \(w\preceq v\) and \(v\preceq w\).
Definition 2
(Sun ( 2011)) For \(X,Y\subseteq W\), \(X\preceq ^s Y\) iff
there are \(u \in X\) and \(u'\in Y\) such that \(u\preceq u'\).
for every \(u\in X\), for every \(u'\in Y\), \(u\preceq u'\).
\(X\prec ^s Y\) is used to denote \(X\preceq ^s Y\) meanwhile \(Y\not \preceq ^s X\).
Definition 3
(Horty ( 2001)) Let \(H\subseteq Agent\) and T, \(T'\in Choice(H)\). \(T \preceq ^s_{H} T'\) iff for all \(S\in Choice(Agent-H)\), \(T\cap S \preceq ^s T'\cap S\).
\(T\preceq ^s_{H} T'\) means that “ \(T'\) weakly dominates T.” From a perspective of decision theory, \(T\preceq ^s_{H} T'\) says that whatever other agents do, the result obtained by choosing \(T'\) is no worse than that of choosing T. \(T\prec ^s_{H}T'\) is short for \(T\preceq ^s_{H} T'\) and \(T' \not \preceq ^s_{H} T\). If \(T\prec ^s_{H} T'\), then we say \(T'\) strongly dominates T.
Definition 4
(Horty ( 2001)) Let H be a set of agents and Y a set of worlds.
$$\begin{aligned} {\textit{Choice}}(H/Y) = \{T: T\in {\textit{Choice}}(H) \, {\textit{and}} \, T\cap Y\ne \emptyset \} \end{aligned}$$
Intuitively, Choice( H /  Y) are those choices made by group H which are consistent with Y.
Definition 5
(Sun ( 2011)) Let T, \(T'\in Choice(H/Y)\).
$$\begin{aligned}&T\preceq ^s_{H/Y}T' \, {\textit{iff for every}} \, S\in {\textit{Choice}}((Agent-H)/\\&\quad (Y\cap (T\cup T'))), T\cap Y\cap S\preceq ^s T'\cap Y\cap S. \end{aligned}$$
\(T\preceq ^s_{H/Y}T'\) means that “ \(T'\) weakly dominates T under the condition of Y.” \(T\prec ^s_{H/Y}T'\), read as “ \(T'\) strongly dominates T under the condition of Y,” is short for \(T\preceq ^s_{H/Y}T'\) and \(T'\not \preceq ^s_{H/Y}T\).
Definition 6
(Horty ( 2001)) Let H be a set of agents,
  • \(Optimal^s_{H}\) = { \(T \in Choice(H):\) there is no \(T'\in Choice(H)\) such that \(T\prec ^s_{H} T'\)}.
  • \(Optimal^s_{H/Y}\) = { \(T \in Choice(H/Y):\) there’s no \(T'\in Choice(H/Y)\) such that \(T\prec ^s_{H/Y}T'\)}.
Definition 7
( Semantics of UDL). Given a utilitarian model \(M=(W,V, choice, \preceq )\) and \(v\in W\),
$$\begin{aligned} \begin{array}{ll} M,v \vDash p &{} {\textit{iff v}}\in V(p);\\ M,v\vDash \lnot \psi &{} {\textit{iff it does not hold that}} \, M,v\vDash \psi ;\\ M,v\vDash \psi \wedge \phi &{} {\textit{iff}} \, M,v\vDash \psi \, {\textit{and}} \, M,v\vDash \phi ;\\ M,v\vDash [H]\psi &{} {\textit{iff}} \, M,v'\vDash \psi , \, {\textit{for all}} \, v'\in W \, {\textit{satisfying}} \\ &{}{\textit{that there is}} \, T\in Choice(H) \\ &{} {\textit{such that}} \, \{v,v'\}\subseteq T;\\ M,v\vDash \bigcirc _{H}\psi &{} {\textit{iff}} \, T\subseteq ||\psi || \, {\textit{for every}} \, T\in {\textit{Optimal}}^s_{H};\\ M,v\vDash \bigcirc _{H}(\psi /\phi ) &{} {\textit{iff}} \, T\subseteq ||\psi || \, {\textit{for every}} \, T\in {\textit{Optimal}}^s_{H/\phi }. \\ \end{array} \end{aligned}$$
Here \(\Vert \psi \Vert =\{v\in W: M,v\vDash \psi \}\).
The miners paradox is characterized by a model \(Miners= (W, V ,Choice, \preceq )\), \(W=\{v_1,\ldots , v_6\}\), \(Choice(H)=\{\{v_1,v_2\},\) \(\{v_3,v_4\},\{v_5,v_6\}\}\), \(Choice(Agent-H)=\{W\}\), \(v_3\approx v_6\preceq v_1\approx v_2 \preceq v_4 \approx v_5\), \(V({\textit{in}}\_ A) =\{v_1,v_3,v_5\}\), \(V({\textit{in}}\_ B) =\{v_2,v_4,v_6\}\), \(V({\textit{block}}\_ A) =\{v_5, v_6\}\), \(V({\textit{block}}\_ B) =\{v_3, v_4\}\), \(V({\textit{block}}\_{\textit{neither}}) =\{v_1, v_2\}\) (Fig. 1).
Group H can choose \({\textit{block}}\_A\), \({\textit{block}}\_B\) or \({\textit{block}}\_{\textit{neither}}\), while other agents can only choose W. All the three choices of group H are optimal by the strong lifting. Therefore, \(Miners, v_1\not \vDash \bigcirc _H ({\textit{block}}\_{\textit{neither}})\). Therefore, UDL cannot solve the miners paradox.

3.1 Utilitarian deontic logic via pessimistic lifting

With the motivation of solving the miners paradox, we introduce a new logic called pessimistic utilitarian deontic logic (PUDL), in which pessimistic lifting is used instead of strong lifting. We will show that PUDL not only solves the miners paradox but also solves Ross’s paradox and the contrary to duty paradox. We then present an axiomatization for PUDL and generalize PUDL to MADL in the next subsection.
Informally, \({\textit{block}}\_{\textit{neither}}\) in the miners scenario is the only optimal choice according to the pessimistic lifting. Hence, “we ought to block neither” holds. Moreover, in PUDL both (2) and (3) are true, whereas the inference from (2)-(4) to (5) is invalid. Therefore, PUDL is capable of solving the miners paradox. Now, we present these arguments formally.

3.1.1 Language

The language \(\mathfrak {L}_{pudl}\) is generated by the following BNF:
$$\begin{aligned} \psi \ {::=} \ p\mid \lnot \psi \mid \psi \wedge \psi \mid [i]\psi \mid [\preceq ]\psi \mid [\prec ] \psi \mid [\succeq ]\psi \mid \square \psi \end{aligned}$$
Intuitively, \([i]\psi \) means that “agent i sees to it that \(\psi \).” \(\square \psi \) says that “ \(\psi \) is true everywhere.” \([\preceq ]\psi \) express “ \(\psi \) is weakly preferable” while \([\prec ]\psi \) states that “ \(\psi \) is strictly preferable.” \([\succeq ]\psi \) means that “ \(\psi \) is unpreferable.” \(\langle \preceq \rangle \), \(\langle \prec \rangle \) and \(\lozenge \) are dual for \([\preceq ]\), \([\prec ]\) and \(\square \), respectively. The relation \(\preceq \) must be reflexive, transitive and total, while \(\prec \) must satisfy that \(v\prec w\) iff \(v\preceq w\) and \(w\not \preceq v\). Pessimistic lifting is defined in \(\mathfrak {L}_{pudl}\) as follows:
  • pessimistic lifting: \(\psi \preceq ^{p} \phi {::=} \square (\phi \Rightarrow \langle \succeq \rangle \psi ) \). Informally, the formula \(\square (\phi \Rightarrow \langle \succeq \rangle \phi ) \) says that every \(\phi \)-world is weakly better than some \(\psi \)-world.
We use \(\psi \prec ^{p}\phi \) to denote \( \lnot ( \phi \preceq ^{p} \psi ) \wedge (\psi \preceq ^{p} \phi )\). Obligation in \(\mathfrak {L}_{pudl}\) is characterized as follows:
  • \(\bigcirc _i \psi {::=} (\lnot \psi \prec ^p [i]\psi ) \wedge \lozenge [i]\psi \). That is to say, agent i ought to STIT \(\psi \) if and only if in the pessimistic sense STIT \(\psi \) is strictly better than \(\lnot \psi \) and it is possible for i to STIT \(\psi \).
  • \(\bigcirc _i (\psi /\phi ) {::=} \lozenge [i]\psi \wedge ((\lnot \psi \wedge \phi ) \prec ^p ([i] \phi \wedge \psi ))\).

3.1.2 Semantics

We now introduce the semantics of PUDL.
Definition 8
A tuple \(M= ( W, \preceq , \prec , IndChoice, V )\) is a pessimistic utilitarian model if W and IndChoice are the same as in the utilitarian model, \(\preceq \) is a relation over W that represents the social welfare of all agents, \(\preceq \) is reflexive, transitive and connected. 1 \(\prec \) is a relation over W such that for every \(v,v'\in W\), \(v\prec v'\) iff \(v'\not \preceq v\) meanwhile \(v\preceq v'\).
Let \(R_i\) be a relation such that \((v,v')\in R_i\) if and only if there exists a \(T\in IndChoice(i)\) with \(\{v,v'\}\subseteq T\). The semantics of \(\mathfrak {L}_{pudl}\) is defined as follows:
Definition 9
Given a pessimistic utilitarian model M and \(v\in W\),
$$\begin{aligned} \begin{array}{ll} M,v\vDash _{pudl} [i]\psi &{} {\textit{iff}} \, M,u\vDash \psi \, {\textit{for every u with}} \, (v,u)\in R_i;\\ M,v\vDash _{pudl} [\preceq ] \psi &{} {\textit{iff}} \, M,u\vDash \psi {\textit{for every u with}} \, v\preceq u;\\ M,v\vDash _{pudl} [\succeq ] \psi &{} {\textit{iff}} \, M,u\vDash \psi \, {\textit{for every u with}} \, u\preceq v;\\ M,v\vDash _{pudl} [\prec ] \psi &{} {\textit{iff}} \, M,u\vDash \psi \, {\textit{for every u with}} \, v\prec u;\\ M,v\vDash _{pudl} \square \psi &{} {\textit{iff}} \, M,u\vDash \psi \, {\textit{for every}} \, u\in W. \end{array} \end{aligned}$$

3.1.3 Solving the miners paradox

We formally describe the miners scenario by a pessimistic utilitarian model. Let \(Miners^p= (W, IndChoice, \preceq , \prec , V)\) such that \(W=\{v_1,\) \(\ldots , v_6\}\), \(IndChoice(i)=\{\{v_1,v_2\},\) \(\{v_3,v_4\},\{v_5,v_6\}\}\), \(IndChoice(j)=\{W\}\) for all \(j\not = i\), \(v_3\approx v_6 \prec v_1\approx v_2 \prec v_4 \approx v_5\), \(V({\textit{in}}\_ A) =\{v_1,v_3,v_5\}\), \(V({\textit{in}}\_B) =\{v_2,v_4,v_6\}\), \(V({\textit{block}}\_ A) =\{v_5, v_6\}\), \(V({\textit{block}}\_ B) =\{v_3, v_4\}\), \(V({\textit{block}}\_{\textit{neither}}) =\{v_1, v_2\}\).
We know that \(\lnot {\textit{block}}\_{\textit{neither}}\) is strictly worse than \([i] {\textit{block}}\_{\textit{neither}}\) according to the pessimistic semantics. Therefore, \(Miners^p\), \(v_1 \vDash \bigcirc _i ({\textit{block}}\_{\textit{neither}})\). Moreover, we have “if the miners are in A, then i ought to block A” because \(\lnot {\textit{block}}\_ A\) is worse than \([i] {\textit{block}}\_A\), given the condition of miners being in A. Therefore, \(Miners^p, v_1 \vDash \bigcirc _i ({\textit{block}}\_A/in\_A)\). Similarly \(Miners^p, v_1 \vDash \bigcirc _i ({\textit{block}}\_ B/in\_B)\). It remains to prove that even if “if the miners are in A, then we ought to block A” and “if the miners are in B, then we ought to block B” are both true, we do not infer that “we ought to block either A or B.” The following proposition justifies such reasoning.
Proposition 1
\(\not \vDash _{pudl} \bigcirc _{i} (\phi /\psi ) \wedge \bigcirc _{i} (\phi / \chi )\Rightarrow \bigcirc _{i} (\phi /(\psi \vee \chi )) \).

3.1.4 Bonus 1: solving the contrary to duty paradox

The contrary to duty paradox is one of the most serious paradoxes in deontic logic. The best known example of this paradox is give by Chisholm ( 1963):
It ought to be that you go to the party;
It ought to be that if you go, then you tell them you are going;
If you don’t go, you ought not to tell them you are going;
You do not go.
Intuitively, these four statements are consistent and independent of each other. But either the consistency or the independency is lost after they are translated to standard deontic logic. In our logic, fortunately, we survive form such predicament.
Let p represent “go to the party.” Let q represent “tell them you are going.” Then, we can formalize the four statements using our logic in the following way:
\(\bigcirc _i p\)
\(\bigcirc _i (p\Rightarrow q)\)
\(\bigcirc _i(\lnot q/\lnot p)\)
\(\lnot p\)
It’s not hard to see that the above four formulas are independent of each other. For consistency, consult the following example.
Example 1
Let \(M=(W,V, IndChoice, \preceq , \prec )\), \(W=\{v_{1},\ldots , v_{4}\}\), \(IndChoice(i)=\{\{v_1\},\{v_2\},\{v_3\},\{v_4\}\}\), \(v_1\prec v_2 \prec v_3 \prec v_4\). \(V(p)=\{v_{3},v_4\}\), \(V(q)=\{v_{1}, v_4\}\). See Fig.  2. In this model, we have all the four formulas \((a)-(d)\) are all true in \(v_{1}\).

3.1.5 Bonus 2: solving Ross’ paradox

Another well-known paradox in deontic logic is Ross’ paradox Alfred ( 1941):
Suppose John should send a letter. Since sending the letter implies sending it or burning it, John should send the letter or burn it.
In UDL, the formula \(\bigcirc _{H} \phi \Rightarrow \bigcirc _{H} (\phi \vee \psi )\) is valid, which means UDL cannot solve Ross’ paradox. On the other hand, PUDL solves Ross’ paradox, as the following proposition shows.
Proposition 2
\(\not \vDash _{pudl} \bigcirc _{i} \phi \Rightarrow \bigcirc _{i} (\phi \vee \psi )\).

3.1.6 Axiomatization of PUDL

The axiomatic system of PUDL contains the rules necessitation for \(\square , [\preceq ], [\succeq ],[\prec ], [1],\ldots , [n] \), modus pones, and the following axioms:
Mutual converse for \([\preceq ]\) and \([\succeq ]\):
\((\psi \Rightarrow [\succeq ]\langle \preceq \rangle \psi ) \wedge (\psi \Rightarrow [\preceq ]\langle \succeq \rangle \psi ) \).
S4.3 for \([\preceq ]\):
\([\preceq ](\psi \Rightarrow \phi ) \Rightarrow ([\preceq ]\psi \Rightarrow [\preceq ] \phi )\);
\([\preceq ]\psi \Rightarrow [\preceq ][\preceq ]\psi \);
\([\preceq ]\psi \Rightarrow \psi \);
\(\langle \preceq \rangle \phi \wedge \langle \preceq \rangle \psi \Rightarrow (\langle \preceq \rangle (\psi \wedge \langle \preceq \rangle \phi ) \vee \langle \preceq \rangle (\phi \wedge \langle \preceq \rangle \psi ) \vee \langle \preceq \rangle (\psi \wedge \phi ) )\).
K for \([\prec ]\):
\([\prec ](\psi \Rightarrow \phi ) \Rightarrow ([\prec ]\psi \Rightarrow [\prec ] \phi )\).
\([\prec ]\psi \Rightarrow [\preceq ][\prec ]\psi \);
\([\prec ]\psi \Rightarrow [\prec ][\preceq ]\psi \);
\([\preceq ]([\preceq ]\psi \vee \phi )\wedge [\prec ]\phi \Rightarrow \psi \vee [\preceq ]\phi \).
\(\square \psi \Rightarrow [\preceq ]\psi \);
\([\preceq ]\psi \Rightarrow [\prec ]\psi \);
for \(i\in Agent\), \(\square \psi \Rightarrow [i]\psi \).
Agent independent: \((\lozenge [1]\psi _1 \wedge \cdots \wedge \lozenge [n]\psi _n)\Rightarrow \lozenge ([1]\psi _1 \wedge \cdots \wedge [n]\psi _n)\).
S5 for \( \square \).
S5 for [ i], \(i\in Agent\).
If \(\psi \) can be deduced from the above axiomatic system ( \(\vdash _{pudl} \psi \)), then \(\psi \) is a theorem of PUDL. We say \(\psi \) is deducible from \({\varGamma }\) ( \({\varGamma }\vdash _{pudl} \psi \)), where \({\varGamma }\) is a set of formulas, if \(\vdash _{pudl} \psi \) or there are formulas \(\phi _1,\ldots ,\phi _n\in {\varGamma }\) such that \(\vdash _{pudl} (\phi _1 \wedge \cdots \wedge \phi _n)\Rightarrow \psi \).
Theorem 1
\({\varGamma }\vdash _{pudl} \psi \) iff \({\varGamma }\vDash _{pudl} \psi \)
The completeness (right-to-left) can be proved by using a canonical model technique together with Bulldozing (Segerberg 1971), and both are standard technique in modal logic. The proof of soundness (left-to-right) is trivial.

3.2 Multi-authority deontic STIT logic

Now we generalize PUDL to MADL. The main difference between them is that in MADL, deontic modality is interpreted via multiple authorities.

3.2.1 Language

The language of MADL is constructed from Agent, \({\varPsi }\), a set of authorities Auth, a set of objects Obj and a set of atomic action Act. For \(i\in Agent\), \(o\in Obj\) and \(a\in Act\), do( iao) is an atomic formula, which means agent i execute action a on object o. For atomic formulas pq, \(i\in Agent\) and \(j\in Auth\), the language \(\mathfrak {L}_{madl}\) is generated by the following BNF:
$$\begin{aligned}&\psi {::=} p\mid \lnot \psi \mid \psi \wedge \psi \mid [i]\psi \mid \square \psi \mid [\preceq _j]\psi \\&\quad \mid [\succeq _j]\psi \mid [\prec _j] \psi \end{aligned}$$
Intuitively, \([\preceq _j]\psi \) means that “ \(\psi \) is weakly preferable according to the normative standard of authority j,” while \([\prec _j]\psi \) means “ \(\psi \) is strictly preferable according to the normative standard of authority j.” \([\succeq _j]\psi \) means “ \(\psi \) is unpreferable according to the normative standard of authority j.” We use \(\psi \prec ^{j}\phi \) as an abbreviation of \((\psi \preceq ^{j} \phi )\wedge \lnot ( \phi \preceq ^{j} \psi )\). Obligation is expressed in \(\mathfrak {L}_{madl}\) as follows:
  • \(\bigcirc ^{j}_i \psi {::=} (\lnot \psi \prec ^j [i]\psi ) \wedge \lozenge [i]\psi \). Intuitively, this formula means that agent i ought to see to it that \(\psi \) according to the normative value of authority j iff \(\lnot \psi \) is strictly worse than seeing to it that \(\psi \) according to the normative value of authority j and it is possible for i to see to it that \(\psi \).
  • \(\bigcirc ^{j}_i (\psi /\phi ) {::=} ((\lnot \psi \wedge \phi ) \prec ^j ([i]\psi \wedge \phi )) \wedge \lozenge [i]\psi \).
To specify security policies, we further introduce (conditional) prohibition and (conditional) permission in \(\mathfrak {L}_{madl}\):
  • \(F ^{j}_i \psi {::=} \bigcirc ^{j}_i \lnot \psi \). This means according to the normative value of authority j, agent i is forbidden to STIT \(\psi \) iff i is obliged to STIT \(\lnot \psi \).
  • \(F^{j}_i (\psi /\phi ) {::=} \bigcirc ^{j}_i (\lnot \psi /\phi ) \).
  • \(P ^{j}_i \psi {::=} \lnot F ^{j}_i \psi \). This means according to the normative value of authority j, agent i is permitted to see to it that \(\psi \) iff i is not forbidden to see to it that \( \psi \).
  • \(P ^{j}_i(\psi /\phi ) {::=} \lnot F ^{j}_i (\psi /\phi ) \).

3.2.2 Semantics

The semantics of MADL is based on multi-authority STIT model, which is a generalization of PUDL model.
Definition 10
( Multi-authority STIT model) A Multi-authority STIT model \(M= ( W, IndChoice, \preceq _1, \prec _1,\ldots , \preceq _m, \prec _m, V )\) is a tuple where W and IndChoice are the same as in PUDL model, and \(\preceq _j\) is a relation on W indicating the normative standard of authority j. \(\preceq _j\) is required to be reflexive, transitive and connected. \(\prec _j\) is a sub-relation of \(\preceq _j\) such that for all \(v,v'\in W\), \(v\prec _j v'\) iff \(v \preceq _j v'\) and \(v'\not \preceq _j v\).
The semantics of \(\mathfrak {L}_{mddl}\) is defined similarly to that of PUDL; here, we only give the crucial cases:
Definition 11
Let M be a multi-authority STIT model, \(v\in W\).
$$\begin{aligned} \begin{array}{ll} M,v \vDash _{madl} [\preceq ^j] \psi &{} {\textit{iff}} \, M,u\vDash _{madl} \psi \, {\textit{for all w such that}} \, v\preceq _j u;\\ M,v\vDash _{madl} [\succeq ^j] \psi &{} {\textit{iff M}},u \vDash _{madl} \psi \, {\textit{for all u such that}}\, u\preceq _j v;\\ M,v\vDash _{madl} [\prec ^j] \psi &{} {\textit{iff}} \, M,u\vDash _{madl} \psi \, {\textit{for all u such that}} \, v\prec _j u; \end{array} \end{aligned}$$

3.2.3 Axiomatization of MADL

The axiomatic system of MADL is obtained by a simply modification of the proof system of PUDL: Simply replace the occurrence of \([\preceq ], [\succeq ]\) and \([\prec ]\) by \([\preceq ^j], [\succeq ^j]\) and \([\prec ^j]\) for each \(j\in Auth\).
Theorem 2
(Soundness and completeness) \({\varGamma }\vdash _{madl} \psi \) iff \({\varGamma }\vDash _{madl} \psi \).

4 Related work

Using logics to handle the problems of specifying and reasoning about the security of information systems started from 1988 by Glasgow and MacEwen ( 1988). Since then, various types of logic have been used to model inference abilities and specification of security policies. Van Hertum et al. ( 2016) have recently proposed a multi-agent variant of autoepistemic logic, called Distributed Autoepistemic Logic with Inductive Definitions (dAEL(ID)), to be used as a says-based access control logic. By applying the semantic principles of autoepistemic logic to characterize the says-modality, dAEL(ID) allows us to derive a statement of the form \(says_{\lnot k} \psi \) on the basis of the observation that k has not issued statements implying \(\psi \). Supporting reasoning about such negated says-statements allows dAEL(ID) to straightforwardly model access denials, which can hardly be modeled by previous says-based access control logics.

5 Summary and future work

In this article, we have developed a deontic STIT logic with the possible application to the specification of security policy for intrude detection in the pervasive computing environment. Compared to the existing deontic STIT logics, an advantage of our logic is that it is capable of solving the miners paradox, a logical paradox which recently grabs attentions of logicians, philosophers, linguistists and computer scientists. A complete and sound axiomatization for our logic was developed. Concerning future works, we will study the computational complexity of our logic and perform some case study for the application of our logic to security policies.


Lirong Qiu has been supported by the National Nature Science Foundation of China (Nos. 61672553, 61331013). Xin Sun has been supported by the National Science Centre of Poland (BEETHOVEN, UMO-2014/15/G/HS1/04514).

Compliance with ethical standards

Conflict of interest

Both authors declare that they have no conflict of interest.

Human and animals participants

This article does not contain any studies with human participants or animals performed by any of the authors.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License ( http://​creativecommons.​org/​licenses/​by/​4.​0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
\(\preceq \) is connected if for all \(v,v'\in W\), either \(v\preceq v'\), or \(v'\preceq v.\)
Über diesen Artikel

Weitere Artikel der Ausgabe 3/2018

Soft Computing 3/2018 Zur Ausgabe

Premium Partner