## Weitere Artikel dieser Ausgabe durch Wischen aufrufen

Erschienen in:

Open Access 23.05.2022

# Local is Best: Efficient Reductions to Modal Logic K

verfasst von: Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon

Erschienen in: Journal of Automated Reasoning | Ausgabe 4/2022

print
DRUCKEN
insite
SUCHEN

## Abstract

We present novel reductions of extensions of the basic modal logic $${\textsf {K} }$$ with axioms $$\textsf {B}$$, $$\textsf {D}$$, $$\textsf {T}$$, $$\textsf {4}$$ and $$\textsf {5}$$ to Separated Normal Form with Sets of Modal Levels $$\textsf {SNF} _{sml}$$. The reductions typically result in smaller formulae than the reductions by Kracht. The reductions to $$\textsf {SNF} _{sml}$$ combined with a reduction to $$\textsf {SNF} _{ml}$$ allow us to use the local reasoning of the prover $${\text {K}_{\text {S}}}{\text {P}}$$ to determine the satisfiability of modal formulae in the considered logics. We show experimentally that the combination of our reductions with the prover $${\text {K}_{\text {S}}}{\text {P}}$$ performs well when compared with a specialised resolution calculus for these logics, the built-in reductions of the first-order prover SPASS, and the higher-order logic prover LEO-III.
Hinweise
C. Dixon was partially supported by the EPSRC funded RAI Hubs FAIR-SPACE (EP/R026092/1) and RAIN (EP/R026084/1), and the EPSRC funded programme Grant S4 (EP/N007565/1).
The original online version of this article was revised: Several typo errors found in the mathematical symbols, spacing throughout the article and the layout of Tables 1 and 3 were incorrectly processed. The typo errors and layout of Tables 1 and 3 have been corrected.

## Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## 1 Introduction

The main motivation for reducing problems in one logic (the source logic) to ‘equivalent’ problems in another formalism is to exploit results and tools for that formalism to solve theoretical or practical problems in the source logic. For propositional modal logics, this approach has been researched extensively for reductions of the satisfiability problem in these logics to the satisfiability problem in ‘stronger’ logics such as first-order logic [14, 26], second-order theory of n successors [7], simple type theory [4], and regular grammar logics [25].
An alternative approach is to reduce propositional modal logics to a ‘weaker’ logic, in particular, the basic modal logic $${\textsf {K} }$$. For extensions of $${\textsf {K} }$$ with one of the axioms $$\textsf {B}$$, $$\textsf {D}$$, $$\textsf {a}lt _\textsf {1}$$, $$\textsf {T}$$, and $$\textsf {4}$$, Kracht [17] defines reduction functions of their global and local satisfiability problem to the corresponding problem in $${\textsf {K} }$$ and proves their correctness. He also defines a reduction function for $${\textsf {K5} }$$, the extension of $${\textsf {K} }$$ with $$\textsf {5}$$, to $${\textsf {K4} }$$, but this reduction is incorrect as not all theorems of $${\textsf {K4} }$$ are theorems of $${\textsf {K5} }$$. Several features of Kracht’s approach are relevant to our work. First, as is not uncommon in modal logic, he uses $$\Box$$ as the only modal operator occurring in modal formulae and the modal operator $$\Diamond$$ is expressed as $$\lnot \Box \lnot$$. This negatively impacts the size of the resulting formulae as the reduction functions cannot treat the modal operators $$\Box$$ and $$\Diamond$$ differently (as we do here). Second, the basic idea underlying his reduction functions is the following: given a modal formula $$\varphi$$, generate sufficiently many instances $$\Delta$$ of a modal axiom $$\Lambda$$ so that $$\varphi$$ is $${\textsf {K} }\Lambda$$-satisfiable iff $$\varphi \wedge \Delta$$ is $${\textsf {K} }$$-satisfiable. Third, Kracht is concerned with preservation of the computational complexity of the satisfiability problem under consideration, as well as the preservation of other theoretical properties. For instance, the local satisfiability problem in the modal logics covered by Kracht is PSPACE-complete. So, it is sufficient to ensure that $$\Delta$$ is polynomial in size with respect to $$\varphi$$. As Kracht himself concludes, his method offers a uniform way of transferring results about one modal logic to another, but may not be as useful for practical applications.
In [21, 23], we have introduced a new normal form for basic multi-modal logic, called Separated Normal Form with Modal Levels, $$\textsf {SNF}_{ml}$$, which uses labeled modal clauses. These labels refer to the level within a tree Kripke structure at which a modal clause holds. This can be seen as a compromise between approaches that label formulae with worlds at unspecified level [1, 3] and approaches that label formulae with paths [6, 30]. A combination of a normal form transformation for modal formulae and a resolution-based calculus for labeled modal clauses can then be used to decide local and global satisfiability in basic modal logic. In [22, 24], we have presented $${\text {K}_{\text {S}}}{\text {P}}$$, an implementation of that calculus, together with an experimental evaluation that indicates that $${\text {K}_{\text {S}}}{\text {P}}$$ performs well if propositional variables are evenly spread across a wide range of modal levels within the formulae one wants to decide.
A feature of $$\textsf {SNF}_{ml}$$ is its use of additional propositional symbols as ‘surrogates’ for subformulae of a modal formula $$\varphi$$. In the following, we take advantage of the availability of those surrogates to provide a novel transformation from extensions of $${\textsf {K} }$$ with a single one of the axioms $$\textsf {B}$$, $$\textsf {D}$$, $$\textsf {T}$$, $$\textsf {4}$$ and $$\textsf {5}$$ to $$\textsf {SNF}_{ml}$$. Another novel aspect is that we modify the normal form so that it uses sets of modal levels as labels instead of a single modal level. In $${\textsf {K} }$$, we only need a definition of a surrogate at the modal level at which the corresponding subformula occurs in $$\varphi$$. But in $${\textsf {KB} }$$, $${\textsf {KT} }$$, $${\textsf {K4} }$$ and $${\textsf {K5} }$$, we need a definition at every reachable modal level, of which there can be many. We call the resulting normal form, Separated Normal Form with Sets of Modal Levels, $$\textsf {SNF}_{sml}$$.
The structure of the paper is as follows. In Sect. 2, we recap common concepts of propositional modal logic including its syntax and semantics. Section 3 defines $$\textsf {SNF}_{sml}$$. Section 4 defines the reductions of $${\textsf {K} }$$, $${\textsf {KB} }$$, $${{\textsf {KD} }}$$, $${\textsf {KT} }$$, $${\textsf {K4} }$$ and $${\textsf {K5} }$$ to $$\textsf {SNF}_{sml}$$; correctness results are given in Sect. 5. Sect. 6 shows a reduction from $$\textsf {SNF}_{sml}$$ to $$\textsf {SNF}_{ml}$$ and its correctness; the reduction is needed to evaluate our result via $${\text {K}_{\text {S}}}{\text {P}}$$. Related work is discussed in Sect. 7. In Sect. 8, we compare the performance of a combination of our reductions and the modal-layered resolution calculus implemented in $${\text {K}_{\text {S}}}{\text {P}}$$ with resolution calculi specifically designed for the logics under consideration and with translation-based approaches built into the first-order theorem prover SPASS and the higher-order logic prover LEO-III. Section 9 provides concluding remarks and future work.
This paper is an extended and revised version of [29]. We provide correctness proofs for our reductions for $${\textsf {K4} }$$ and $${\textsf {K5} }$$ that were not included in [29]. Section 6 is new and not only defines a satisfiability preserving transformation from $$\textsf {SNF}_{sml}$$ (with infinite sets of labels) to $$\textsf {SNF}_{ml}$$, but also proves its correctness via a simulation of Massacci’s Single Step Tableaux (SST) calculus [18] for $${\textsf {K4} }$$ and $${\textsf {K5} }$$ using the modal-layered resolution calculus for $$\textsf {SNF}_{ml}$$ clauses [21]. For $${\textsf {K5} }$$, we also establish a bound on the length of prefixes in the SST calculus that preserves refutation completeness of the calculus without need for a loop check.

## 2 Preliminaries

The language of modal logic is an extension of the language of propositional logic with unary modal operators $$\Box$$ and $$\Diamond$$. More precisely, given a denumerable set of propositional symbols, $$P= \{p, p_0, q, q_0, t, t_0,\ldots \}$$ as well as propositional constants $$\mathbf{true}$$ and $$\mathbf{false}$$, modal formulae are inductively defined as follows: constants and propositional symbols are modal formulae. If $$\varphi$$ and $$\psi$$ are modal formulae, then so are $$\lnot \varphi$$, $$(\varphi \wedge \psi )$$, $$(\varphi \vee \psi )$$, $$(\varphi \rightarrow \psi )$$, $$\Box \varphi$$, and $$\Diamond \varphi$$. We also assume that $$\wedge$$ and $$\vee$$ are associative and commutative operators and consider, e.g., $$(p\vee (q\vee r))$$ and $$(r\vee (q\vee p))$$ to be identical formulae. We often omit parentheses if this does not cause confusion. By $$\mathsf {var} (\varphi )$$, we denote the set of all propositional symbols occurring in $$\varphi$$. This function straightforwardly extends to finite sets of modal formulae. A modal axiom (schema) is a modal formula $$\psi$$ representing the set of all instances of $$\psi$$.
A literal is either a propositional symbol or its negation; the set of literals is denoted by $$L_{P}$$. We denote by $$\lnot l$$ the complement of the literal $$l\in L_{P}$$, that is, $$\lnot l$$ denotes $$\lnot p$$ if l is $$p \in P$$, and $$\lnot l$$ denotes p if l is the literal $$\lnot p$$. A modal literal is either $$\Box l$$ or $$\Diamond l$$, where $$l \in L_{P}$$.
A (normal) modal logic is a set of modal formulae which includes all propositional tautologies, the axiom schema $$\Box {(\varphi \rightarrow \psi )} \rightarrow (\Box {\varphi } \rightarrow \Box {\psi })$$, called the axiom $$\textsf {K}$$, is closed under modus ponens (if $$\vdash {} \varphi$$ and $$\vdash {} \varphi \rightarrow \psi$$ then $$\vdash {}\psi$$) and the rule of necessitation (if $$\vdash {}\varphi$$ then $$\vdash {} \Box {\varphi }$$). $${\textsf {K} }$$ is the weakest modal logic, that is, the logic given by the smallest set of modal formulae constituting a normal modal logic. By $${\textsf {K} }\varSigma$$, we denote an extensions of $${\textsf {K} }$$ by a set $$\varSigma$$ of axioms.
The standard semantics of modal logics is the Kripke semantics or possible world semantics. A Kripke frame $$F$$ is an ordered pair $$\langle W, R \rangle$$ where $$W$$ is a non-empty set of worlds and $$R$$ is a binary (accessibility) relation over $$W$$. A Kripke structure $$M$$ over $$P$$ is an ordered pair $$\langle F,V \rangle$$ where $$F$$ is a Kripke frame and the valuation V is a function mapping each propositional symbol in $$P$$ to a subset V(p) of $$W$$. We say $$M= \langle F,V \rangle$$ is based on the frame $$F$$. A rooted Kripke structure is an ordered pair $$\langle M,w_0 \rangle$$ with $$w_0\in W$$. In the following, we write $$\langle W, R, V \rangle$$ and $$\langle W, R, V,w_0 \rangle$$ instead of $$\langle \langle W, R \rangle , V \rangle$$ and $$\langle \langle \langle W, R \rangle , V \rangle ,w_0 \rangle$$, respectively.
Satisfaction (or truth) of a formula at a world $$w$$ of a Kripke structure $$M= \langle W, R, V \rangle$$ is inductively defined by:
\begin{aligned} \begin{array}{ll} \langle M, w \rangle \models \mathbf{true}; &{} \langle M, w \rangle \not \models \mathbf{false};\\ \langle M, w \rangle \models p &{} \hbox {iff }w\in V(p), \hbox {where }p\in P;\\ \langle M, w \rangle \models \lnot \varphi &{} \hbox {iff }\langle M, w \rangle \not \models \varphi ;\\ \langle M, w \rangle \models (\varphi \wedge \psi ) &{} \hbox {iff } \langle M, w \rangle \models \varphi \;\hbox {and}\; \langle M, w \rangle \models \psi ;\\ \langle M, w \rangle \models (\varphi \vee \psi ) &{} \hbox {iff }\langle M, w \rangle \models \varphi \;\hbox {or}\; \langle M, w \rangle \models \psi ; \\ \langle M, w \rangle \models (\varphi \rightarrow \psi ) &{} \hbox {iff } \langle M, w \rangle \models \lnot \varphi \;\hbox {or}\; \langle M, w \rangle \models \psi ; \\ \langle M, w \rangle \models \Box \varphi &{} \hbox {iff for every }v, wR{v}\;\hbox {implies}\;\langle M, v \rangle \models \varphi ; \\ \langle M, w \rangle \models \Diamond \varphi &{} \hbox {iff there is }v, wR{v}\;\hbox {and}\;\langle M, v \rangle \models \varphi . \end{array} \end{aligned}
If $$\langle M, w \rangle \models \varphi$$ holds then $$M$$ is a model of $$\varphi$$, $$\varphi$$ is true at w in $$M$$ and $$M$$ satisfies $$\varphi$$. A modal formula $$\varphi$$ is satisfiable iff there exists a Kripke structure $$M$$ and a world w in $$M$$ such that $$\langle M, w \rangle \models \varphi$$.
In the following, we are interested in extensions of $${\textsf {K} }$$ with one of the axiom schemata shown in Table 1. Each of these axiom schemata defines a class of Kripke frames where the accessibility relation $$R$$ satisfies the first-order property stated in the table.
Table 1
Modal axioms and relational frame properties
Name
Axiom
Frame property
$${\textsf {D}}$$
$$\Box \varphi \rightarrow \Diamond \varphi$$
Serial
$${\forall }v\exists {w}.v\mathbin {\!R\!}w$$
$${\textsf {T}}$$
$$\Box \varphi \rightarrow \varphi$$
Reflexive
$${\forall }w.{w}{R}{w}$$
$${\textsf {B}}$$
$$\varphi \rightarrow \Box \!\Diamond \!\varphi$$
Symmetric
$${\forall }vw.{v}{R}{w}\rightarrow w\mathbin {\!R\!}v$$
$${\textsf {4}}$$
$$\Box \varphi \rightarrow \Box \!\Box \!\varphi$$
Transitive
$${\forall }uvw.(u\mathbin {\!R\!}v\wedge {v}{R}{w}){\,\rightarrow \,}{u}{R}{w}$$
$${\textsf {5}}$$
$$\Diamond \varphi \rightarrow \Box \!\Diamond \!\varphi$$
Euclidean
$${\forall }{uvw}.(u\mathbin {\!R\!}v\wedge {u}{R}{w}){\,\rightarrow \,}{v}{R}{w}$$
Given a normal modal logic L with corresponding class of frames $$\mathfrak {F}$$, we say a modal formula $$\varphi$$ is L-satisfiable iff there exists a frame $$F\in \mathfrak {F}$$, a valuation V and a world $$w_0\in F$$ such that $$\langle F,V,w_0 \rangle \models \varphi$$.
A path rooted at $$w$$ of length k, $$k\ge 0$$, in a frame $$F = \langle W,R \rangle$$ is a sequence $$\vec {w} = (w_0,w_1,\ldots ,w_k)$$ where for every i, $$1\le i\le k$$, $$w_{i-1}\mathbin {\!R\!}w_i$$. We say that the path $$(w_0,w_1,\ldots ,w_k)$$ connects $$w_0$$ and $$w_k$$. For a path $$\vec {w} = (w_0,\ldots ,w_k)$$ and world $$w_{k+1}$$ with $$w_k\mathbin {R}w_{k+1}$$, $$\vec {w}\circ w_{k+1}$$ denotes the path $$(w_0,\ldots ,w_k,w_{k+1})$$. A path $$(w_0)$$ of length 0 is identified with its root $$w_0$$. We denote the set of all paths rooted at a world $$w_0$$ in $$F$$ by $$\vec {F}[w_0]$$ and the set of all paths by $$\vec {F}$$. The function $$\mathsf {trm}: \vec {F}\rightarrow W$$ maps every path $$\vec {w} = (w_0,\ldots ,w_k)$$ to its terminal world $$w_k$$ while the function $$\mathsf {len}:\vec {F}\rightarrow {\mathbb N}$$ maps every path $$\vec {w} = (w_0,w_1,\ldots ,w_k)$$ to its length k.
A rooted Kripke structure $$M = \langle W,R,V,w_0 \rangle$$ is a rooted tree Kripke structure iff R is a tree, that is, a directed acyclic connected graph where each node has at most one predecessor, with root $$w_0$$. It is a rooted tree Kripke model of a modal formula $$\varphi$$ iff $$\langle W,R,V,w_0 \rangle \models \varphi$$. In a rooted tree Kripke structure with root $$w_0$$ for every world $$w_k\in W$$ there is exactly one path $$\vec {w}$$ connecting $$w_0$$ and $$w_k$$; the modal level of $$w_k$$ (in M), denoted by $$\mathsf {ml}_{M}(w_k)$$, is given by $$\mathsf {len}(\vec {w})$$.
Let $$F = \langle W, R \rangle$$ be a Kripke frame with $$w\in W$$. The unraveling $$F^u[w]$$ of $$F$$ at $$w$$ is the frame $$\langle \vec {W}, \vec {R} \rangle$$ where:
• $$\vec {W} = \vec {F}[w]$$ is the set of all paths rooted at $$w$$ in $$F$$;
• for all $$\vec {v},\vec {w} \in \vec {W}$$, if $$\vec {w} = \vec {v}\circ w$$ for some $$w\in W$$, then $$\vec {v}\mathbin {\!\vec {R}\!}\vec {w}$$.
Let $$F=\langle W, R \rangle$$ and $$F'=\langle W', R' \rangle$$ be two Kripke frames. A function $$f :W\mapsto W'$$ is a p-morphism (or a bounded morphism) from $$F$$ to $$F'$$ if the following holds:
• if $$v\mathbin {\!R\!}w$$, then $$f(v)\mathbin {\!R'\!}f(w)$$.
• if $$f(u)\mathbin {\!R'\!}w$$, then there exists $$v\in W$$ such that $$f(v)=w$$ and $$u\mathbin {\!R\!}v$$.
Analogously for Kripke models. For $$F = \langle W,R \rangle$$, $$M = \langle F,V,w_0 \rangle$$, and the function $$\mathsf {trm}$$ is a p-morphism from $$M'$$ to $$M$$.
When considering satisfiability, the following holds (see, [12]):
Theorem 1
Let $$\varphi$$ be a modal formula. Then $$\varphi$$ is $${\textsf {K} }$$-satisfiable iff there is a finite rooted tree Kripke structure $$M=\langle F,V,w_0 \rangle$$ such that $$\langle M, w_0 \rangle \models \varphi$$.
Table 2
Rewriting rules for simplification
For the normal form transformation presented in the next section we assume that any modal formula $$\varphi$$ has been simplified by exhaustively applying the rewrite rules in Table 2 and is in Negation Normal Form (NNF), that is, a formula where only propositional symbols are allowed in the scope of negations. We say that such a formula is in simplified NNF.

## 3 Layered Normal Form with Sets of Levels $$\textsf {SNF}_{sml}$$

In [21], we have introduced a novel clausal normal form, called Separated Normal Form with Modal Levels, $$\textsf {SNF}_{ml}$$, whose language extends that of the basic modal logic $${\textsf {K} }$$ with labels for modal levels. Clauses in $$\textsf {SNF}_{ml}$$ have one of the following forms:
\begin{aligned} \textstyle ml: \bigvee _{b=1}^{r} l_b\qquad \quad ml: l' \rightarrow \Box l\qquad \quad ml: l' \rightarrow \Diamond l \end{aligned}
where $$ml\in {\mathbb N}\cup \{{\star }\}$$ and l, $$l'$$, $$l_b$$ are propositional literals with $$1 \le b \le r$$, $$r \in {\mathbb N}$$. Clauses $${\star }:\psi$$ are global clauses.
Given a rooted tree Kripke structure M, the satisfiability of an $$\textsf {SNF}_{ml}$$ clause is defined as follows:
• $$M\models {\star }:\varphi$$ iff $$\langle M, w \rangle \models \varphi$$ for every $$w\in M$$;
• $$M\models ml:\varphi$$ iff $$\langle M, w \rangle \models \varphi$$ for every world w with $$\mathsf {ml}_{M}(w) = ml$$.
The label $${\star }$$ only occurs in the clausal normal form of a modal formula $$\varphi$$ if we consider the problem whether there exists a Kripke structure $$M$$ such that $$\varphi$$ is true at all worlds of $$M$$. For satisfiability of $$\varphi$$ all labels will be from a finite subset of $${\mathbb N}$$. In this case the labels can be seen as a compromise between a normal form where even for local satisfiability all clauses are global and a normal form that uses paths to constrain a clause to just a subset of all worlds at a particular modal level.
A feature of our reductions is that the same formula $$\bigvee _{b=1}^{r} l_b$$, $$l' \rightarrow \Box l$$, or $$l' \rightarrow \Diamond l$$ may have to hold at several levels, possibly even an infinite number of levels. It therefore makes sense to label such formulae not with just a single level but a set of levels. We call this normal form Separated Normal Form with Sets of Modal Levels, $$\textsf {SNF}_{sml}$$. Informally, the labels in $${\textsf {SNF}}_{sml}$$ state that a formula is satisfied at all worlds in a given set of modal levels, instead of a single modal level as in $${\textsf {SNF}}_{ml}$$. We write $$S: \varphi$$, where S is a set of natural numbers, to denote that a formula $$\varphi$$ is true at all modal levels $$ml\in S$$. We write $${\star }: \varphi$$ instead of $${\mathbb N}:\varphi$$.
Formally, given a rooted tree Kripke structures $$M = \langle W,R,V,w_0 \rangle$$ and a set of modal levels S, by M[S], we denote the set of worlds that are at a modal level in S, that is, $$M[S] = \{w\in W\mid \mathsf {ml}_{M}(w)\in S\}$$. The satisfaction of labeled formulae in M is then defined as follows:
\begin{aligned} M\models S: \varphi \, \text{ iff } \text{ for } \text{ every } \text{ world } w\in M[S], \text{ we } \text{ have }\,\, \langle M, w \rangle \models \varphi . \end{aligned}
If $$M\models S: \varphi$$, then we say that $$S: \varphi$$ holds in $$M$$ or is true in $$M$$. For a set $$\varPhi$$ of labeled formulae, $$M\models \varPhi$$ iff $$M\models S:\varphi$$ for every $$S:\varphi$$ in $$\varPhi$$, and we say $$\varPhi$$ is $${\textsf {K} }$$-satisfiable.
Note that if $$S=\emptyset$$, then $$M\models S: \varphi$$ trivially holds. Also, $$S:\mathbf{false}$$ with $$0\not \in S$$, is not in itself unsatisfiable, a Kripke structure $$M$$ can satisfy $$S:\mathbf{false}$$ if it has no worlds w with $$\mathsf {ml}_{M}(w)\in S$$. On the other hand, $$S:\mathbf{false}$$ with $$0\in S$$ is unsatisfiable as a rooted tree Kripke structure always has a world with modal level 0.
A labeled modal formula is then an $$\textsf {SNF}_{sml}$$ clause iff it is of one of the following forms:
• Literal clause $$S: \bigvee _{b=1}^{r} l_b$$
• Positive modal clause $$S: l' \rightarrow \Box l$$
• Negative modal clause $$S: l' \rightarrow \Diamond l$$
where $$S \subseteq {\mathbb N}$$ and l, $$l'$$, $$l_b$$ are propositional literals with $$1 \le b \le r$$, $$r \in {\mathbb N}$$. Positive and negative modal clauses are together known as modal clauses. We regard a literal clause as a set of literals, that is, two clauses are the same if they contain the same set of literals.

## 4 Reductions of Extensions of $${\textsf {K} }$$ with a Single Axiom to $$\textsf {SNF}_{sml}$$

In the following, we assume that the set $$P$$ of propositional symbols is partitioned into two infinite sets Q and T such that Q contains the original propositional symbols and T surrogate symbols $$t_\psi$$ and supplementary propositional symbols. In particular, for every modal formula $$\psi$$, we have $$\mathsf {var}(\psi )\subset Q$$ and there exists a propositional symbol $$t_\psi \in T$$ uniquely associated with $$\psi$$.
We introduce some notation that will be used in the following. Let $$S^+= \{l + 1\in {\mathbb N}\mid l \in S\}$$, $$S^- = \{ l - 1 \in {\mathbb N}\mid l \in S\}$$, and $$S^\ge = \{n \mid n \ge {\textsf {min}}(S)\}$$, where $$\textsf {min}(S)$$ is the least element in S. Note that the restriction of the elements being in $${\mathbb N}$$ implies that $$S^-$$ cannot contain negative numbers.
Given a modal formula $$\varphi$$ in simplified NNF and $$L\in \{{\textsf {K} }, {\textsf {KB} }, {\textsf {KD} }, {\textsf {KT} }, {\textsf {K4} }, {\textsf {K5} }\}$$, then we can obtain a set $$\varPhi _L$$ of clauses in $$\textsf {SNF}_{sml}$$ such that $$\varphi$$ is L-satisfiable iff $$\varPhi _L$$ is $${\textsf {K} }$$-satisfiable as $$\varPhi _L =\{\{ 0 \}: t_\varphi \}\cup \rho _{L}(\{0\}:t_\varphi \rightarrow \varphi )$$, where $$\rho _{L}$$ is defined as follows:
\begin{aligned} \rho _{L}(S : t \rightarrow \mathbf{true})&= \emptyset \\ \rho _{L}(S : t \rightarrow \mathbf{false})&= \{S:\lnot t\} \\ \rho _{L}(S : t \rightarrow (\psi _1 \wedge \psi _2))&= \begin{array}{@{}l@{}} \{S : \lnot t\vee \eta (\psi _1), S : \lnot t\vee \eta (\psi _2)\} \hbox {}{\,\cup \,}\delta _{L}(S,\psi _1){\,\cup \,}\delta _{L}(S,\psi _2) \end{array} \\ \rho _{L}(S : t \rightarrow \psi )&= \begin{array}{@{}l@{}} \{S: \lnot t \vee \psi \}\\ \text{ if } \psi \text{ is } \text{ a } \text{ disjunction } \text{ of } \text{ literals } \end{array} \\ \rho _{L}(S : t \rightarrow (\psi _1 \vee \psi _2))&= \begin{array}{@{}l@{}} \{S: \lnot t\vee \eta (\psi _1)\vee \eta (\psi _2)\} \hbox {}\cup \delta _{L}(S,\psi _1)\cup \delta _{L}(S,\psi _2)\\ \text{ if }\,(\psi _1\vee \psi _2)\;\hbox {is not a disjunction of literals} \end{array}\\ \rho _{L}(S : t \rightarrow \Diamond \psi )&= \{S: t \rightarrow \Diamond \eta (\psi ) \} \cup \delta _{L}(S^+,\psi )\\ \rho _{L}(S : t \rightarrow \Box \psi )&= P_L(S : t \rightarrow \Box \psi ) \cup \Delta _{L}(S : t \rightarrow \Box \psi ) \end{aligned}
where $$\eta$$ and $$\delta _{L}$$ are defined as follows:
and functions $$P_{L}$$, $$\Delta _{L}$$ are defined as shown in Table 3.
Table 3
Transformation of $$\Box$$-formulae in modal logic $$L\in \{{\textsf {K} }, {\textsf {KT} }, {\textsf {KD} }, {\textsf {KB} }, {\textsf {K4} }, {\textsf {K5} }\}$$
 L Axiom $$P_{L}(S:t_{\Box \psi }\rightarrow \Box \psi )$$ $$\Delta _{L}(S:t_{\Box \psi }\rightarrow \Box \psi )$$ $${\textsf {K} }$$ $$S : t_{\Box \psi }\rightarrow \Box \eta (\psi )$$ $$\delta _L(S^+,\psi )$$ $${\textsf {KT} }$$ $$\Box \psi \rightarrow \psi$$ $$S : t_{\Box \psi }\rightarrow \Box \eta (\psi ), S : \lnot t_{\Box \psi }\vee \eta (\psi )$$ $$\delta _L(S\cup S^+,\psi )$$ $${\textsf {KD} }$$ $$\Box \psi \rightarrow \Diamond \psi$$ $$S : t_{\Box \psi }\rightarrow \Box \eta (\psi ), S : t_{\Box \psi }\rightarrow \Diamond \eta (\psi )$$ $$\delta _L(S^+,\psi )$$ $${\textsf {KB} }$$ $$\psi \rightarrow \!\Box \!\Diamond \!\psi$$ $$S : t_{\Box \psi }\rightarrow \Box \eta (\psi ),$$ $$S^- : \eta (\psi )\vee t_{\Box \lnot t_{\Box \psi }}, S^-$$ : $$t_{\Box \lnot t_{\Box \psi }}\rightarrow \Box \lnot t_{\Box \psi }$$ $$\delta _L(S^-\cup S^+,\psi )$$ $${\textsf {K4} }$$ $$\Box \psi \rightarrow \!\Box \!\Box \!\psi$$ $$S^{\ge } : t_{\Box \psi }\rightarrow \Box \eta (\psi ), S^{\ge } : t_{\Box \psi }\rightarrow \Box t_{\Box \psi }$$ $$\delta _L((S^+)^{\ge },\psi )$$ $${\textsf {K5} }$$ $$\Diamond \varphi \rightarrow \!\Box \!\Diamond \!\varphi$$ $${\star }: t_{\Box \psi }\rightarrow \Box \eta (\psi ),$$ $${\star }: \lnot t_{\Diamond t_{\Box \psi }}\vee t_{\Box \psi }, \,{\star }: t_{\Diamond t_{\Box \psi }}\rightarrow \Diamond t_{\Box \psi },$$ $${\star }: \lnot t_{\Diamond t_{\Box \psi }}\rightarrow \Box \lnot t_{\Box \psi },{\star }: t_{\Diamond t_{\Box \psi }}\rightarrow \Box t_{\Diamond t_{\Box \psi }}$$ $$\delta _L({\star },\psi )$$
The function $$\eta$$ maps a propositional literal $$\psi$$ to itself while it maps every other modal formula $$\psi$$ to a new propositional symbol $$t_\psi \in T$$ uniquely associated with $$\psi$$. We call $$t_\psi$$ the surrogate of $$\psi$$ or simply a surrogate. The functions $${P_{{\textsf {\textit{KB}}}}}$$ and $${P_{{\textsf {\textit{K5}}}}}$$ introduce additional propositional symbols, called supplementary propositional symbols, $$t_{\Box \lnot t_{\Box \psi }}\in T$$ and $$t_{\Diamond t_{\Box \psi }}\in T$$, respectively, that do not correspond to subformulae of the formula we are transforming.
For $${P_{{\textsf {\textit{KT}}}}}$$, $${P_{{\textsf {\textit{KD}}}}}$$ and $${P_{{\textsf {\textit{K4}}}}}$$ the additional clauses $$S : \lnot t_{\Box \psi }\vee \eta (\psi )$$, $$S : t_{\Box \psi }\rightarrow \Diamond \eta (\psi )$$ and $$S : t_{\Box \psi }\rightarrow \Box t_{\Box \psi }$$, respectively, are directly based on the axiom schemata. Intuitively, $${P_{{\textsf {\textit{KB}}}}}$$ is based on the following consideration: take a world w in a Kripke structure $$M$$ with a symmetric accessibility relation $$R$$. If there exists a world v with $$w\!\mathbin {R}\!v$$ such that $$\langle M, v \rangle \models \Box \psi$$, then $$\langle M, w \rangle \models \psi$$. Now, take the contrapositive of that statement: If $$\langle M, w \rangle \not \models \psi$$, then for every world v with $$w\mathbin {\!R\!}v$$, $$\langle M, v \rangle \not \models \Box \psi$$. Equivalently, $$\langle M, w \rangle \models \psi$$ or $$\langle M, w \rangle \models \Box \lnot \!\Box \!\psi$$. This is expressed by the formula $$\eta (\psi )\vee t_{\Box \lnot t_{\Box \psi }}$$. For $${P_{{\textsf {\textit{K5}}}}}$$, the formula $$t_{\Diamond t_{\Box \psi }}\rightarrow \Box t_{\Diamond t_{\Box \psi }}$$ expresses an instance of axiom schema $${{{\textsf {\textit{5}}}}}$$, $$\Diamond \varphi \!\rightarrow \Box \!\Diamond \!\varphi$$, with $$\varphi = \Box {\psi }$$, i.e., $$\Diamond \!\Box \!\psi \rightarrow \Box \!\Diamond \!\Box \psi$$. The contrapositive of axiom schema $$\textsf {5}$$ is $$\Diamond \Box \varphi \rightarrow \Box \varphi$$, equivalent to $$\lnot \Diamond \!\Box \varphi \vee \Box \varphi$$. For $$\varphi =\psi$$ this is expressed by the formula $$\lnot t_{\Diamond t_{\Box \psi }}\vee t_{\Box \psi }$$. For the formula $$\lnot t_{\Diamond t_{\Box \psi }}\rightarrow \Box \lnot t_{\Box \psi }$$, consider $$\lnot \!\Diamond \!\Box \!\psi$$. By duality of $$\Box$$ and $$\Diamond$$, this is equivalent to $$\lnot \lnot \!\Box \!\lnot \!\Box \!\psi$$ and $$\Box \lnot \!\Box \!\psi$$. So, $$\lnot \!\Diamond \!\Box \psi \rightarrow \Box \lnot \!\Box \!\psi$$ in every normal modal logic, not only $${\textsf {K5} }$$. The remaining labeled formulae introduced by $${P_{{\textsf {\textit{KB}}}}}$$ and $${P_{{\textsf {\textit{K5}}}}}$$ ensure that supplementary propositional symbols are defined.
To simplify presentation in the following, we define a function $$\eta _f$$ as follows:
\begin{aligned} \eta _f(\varphi _1\wedge \varphi _2)&= \eta (\varphi _1)\wedge \eta (\varphi _2)&\eta _f(\varphi _1\vee \varphi _2)&= \eta (\varphi _1)\vee \eta (\varphi _2)\\ \eta _f(\Box \varphi )&= \Box \eta (\varphi )&\eta _f(\Diamond \varphi )&= \Diamond \eta (\varphi ) \end{aligned}
and we treat the two clauses $$S: \lnot t_{\psi _1\wedge \psi _2} \vee \eta (\psi _1)$$ and $$S: \lnot t_{\psi _1\wedge \psi _2} \vee \eta (\psi _2)$$ resulting from the normal form transformation of $$\psi _1\wedge \psi _2$$ as a single ‘clause’ $$S: \lnot t_{\psi _1\wedge \psi _2} \vee \eta _f(\psi _1\wedge \psi _2)$$. We also interchangeably write $$S:\lnot t_{\Box \psi }\vee \eta _f(\Box \psi )$$ for $$S:t_{\Box \psi }\rightarrow \eta _f(\Box \psi )$$ and, analogously, $$S:\lnot t_{\Diamond \psi }\vee \eta _f(\Diamond \psi )$$ for $$S:t_{\Diamond \psi }\rightarrow \eta _f(\Diamond \psi )$$. We then call any clause of the form $$S:\lnot t_\psi \vee \eta _f(\psi )$$ a definitional clause.
Definition 1
Let $$\varPhi$$ be a set of $$\textsf {SNF}_{sml}$$ clauses. We say $$t_\psi \in T$$ occurs at level ml in $$\varPhi$$ iff either
(a)
there exists a clause $$S:\vartheta$$ in $$\varPhi$$ with $$ml\in S$$ such that $$\vartheta$$ is a propositional formula and $$t_\psi$$ occurs positively in $$\vartheta$$, or

(b)
there exists a clause $$S:t_{\Box \psi }\rightarrow \Box t_\psi$$ in $$\varPhi$$ with $$ml-1\in S$$, or

(c)
there exists a clause $$S:t_{\Diamond \psi }\rightarrow \Diamond t_\psi$$ in $$\varPhi$$ with $$ml-1\in S$$.

Definition 2
Let $$\varPhi$$ be a set of $$\textsf {SNF}_{sml}$$ clauses. Then $$\varPhi$$ is definition-complete iff for every $$t_\psi \in T$$ and every level ml, if $$t_\psi$$ occurs at level ml in $$\varPhi$$ then either (i) $$t_\psi = t_{\mathbf{true}}$$, or (ii) there exists a clause $$S: \lnot t_\psi \vee \eta _f(\psi )$$ in $$\varPhi$$ with $$ml\in S$$.
Example 1
Consider the formula $$\varphi =\Diamond q \wedge \Diamond \!\!\Diamond \!(\Box (p \wedge \Diamond \!\!\Diamond \!\lnot p)\wedge \Diamond q)$$ in the modal logic $${\textsf {K4} }$$. Then $$\{\{0\}:t_\varphi \}\cup \rho _{{\textsf {K4} }}(\{0\}:t_\varphi \rightarrow \varphi )$$ consists of the following clauses.
where $$\psi _4 = p \wedge \!\Diamond \!\!\Diamond \!\!\lnot p$$, $$\psi _3 = \Box {}\psi _4 \wedge \Diamond q$$, $$\psi _2 = \Diamond \psi _3$$, and $$\psi _1 = \Diamond \psi _2$$. All propositional symbols of the form $$t_\psi$$ are surrogate symbols for the respective $$\psi$$ formulae, which are subformulae of $$\varphi$$. All clauses except for Clause (10) would also be present in $$\{\{0\}:t_\varphi \}\cup \rho _{{\textsf {K} }}(\{0\}:t_\varphi \rightarrow \varphi )$$ but Clauses (9), (11) to (14) would be labeled with singleton sets $$\{n\}$$ instead of infinite sets $$\{n\}^\ge$$. Clauses (2) to (9) and (11) to (14) are definitional clauses. Clause (8) is an example of how sets of levels allow for a single definition of a clause appearing at different modal levels. Clause (10) is specific to $${\textsf {K4} }$$, and all clauses from (9) onwards have a set of levels of the form $$\{n\}^\ge$$, which means that they hold at all levels greater than or equal to n.
Theorem 2
Let $$L\in \{{\textsf {K} },{\textsf {KB} },{\textsf {KD} },{\textsf {KT} },{\textsf {K4} },{\textsf {K5} }\}$$. Then $$\varPhi _L =\{\{ 0 \}: t_\varphi \}\cup \rho _{L}(\{0\}:t_\varphi \rightarrow \varphi )$$ is definition-complete.
Proof
By induction over the computation of $$\varPhi _L$$. It is straightforward to see that the transformation of labeled formulae $$S: t\rightarrow (\psi _1\wedge \psi _2)$$ and $$S: t\rightarrow (\psi _1\vee \psi _2)$$ only introduces surrogates at levels in S and $$\Delta _L$$ then adds definitional clauses for those surrogates. The transformation of a labeled formula $$S: t_{\Diamond \psi }\rightarrow \Diamond \psi$$ may introduce a surrogate at levels in $$S^+$$ and $$\delta _L(S^+,\psi )$$ then adds definitional clauses for those surrogates. The transformation of a labeled formula $$S: t_{\Box \psi }\rightarrow \Box \psi$$ depends on the logic L. We can see that for every level at which a new surrogate occurs in $$P_L(S: t_{\Box \psi }\rightarrow \Box \psi )$$, then $$\Delta _L(S: t_{\Box \psi }\rightarrow \Box \psi )$$ contains a definitional clause for it at that level. Where a definitional clause introduced in the transformation has the form $$S:t_{\mathbf{true}}\rightarrow \mathbf{true}$$ it will at some point be eliminated, but this is compatible with our notion of definition-completeness.$$\square$$

## 5 Correctness

### 5.1 Common Properties

Lemma 1
Let $$\varphi$$ be modal formula. Let $${\varPhi = \{\{ 0 \}: t_\varphi \} \cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$ and $$\varPhi _{L} = \{\{ 0 \}: t_\varphi \} \cup \rho _{L}(\{0\}:t_\varphi \rightarrow \varphi )$$, for $$L\in \{{\textsf {KB} },{\textsf {KD} },{\textsf {KT} },{\textsf {K4} },{\textsf {K5} }\}$$. Then $$\varPhi \subseteq \varPhi _{L}$$.
Proof
By definition of $$\rho _{{\textsf {K} }}$$ and $$\rho _{L}$$, anything obtained via $$\rho _{{\textsf {K} }}$$ is also obtained via $$\rho _{L}$$. Therefore, $$\varPhi \subseteq \varPhi _{L}$$.$$\square$$
Lemma 2
Let $$M=\langle W, R, V, w_0 \rangle$$ be a rooted Kripke structure. Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W, R \rangle$$ at $$w_0$$. Let $$\vec {M}= \langle \vec {W}, \vec {R}, \vec {V_\varSigma },(w_0) \rangle$$ where $$\vec {V_\varSigma }(p) = \{\vec {w} \in \vec {W} \mid \mathsf {trm}(\vec {w}) \in V(p)\}$$ for every propositional symbol $$p\in Q$$.
Then for every modal formula $$\psi$$ over Q and for every world $$\vec {w}\in \vec {W}$$, $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \psi$$.
In contrast to similar results in the literature, see, e.g., [5, Propositions 2.14 and 2.15], we allow $$\vec {V_\varSigma }(p)$$ to differ from V(p) for propositional symbols not in Q. This then allows us to freely define $$\vec {V_\varSigma }(t_\psi )$$ for $$t_\psi \in T$$.
Lemma 3
Let $$M=\langle W, R, V, w_0 \rangle$$ be a rooted Kripke structure. Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W, R \rangle$$ at $$w_0$$. Let $$\vec {M}= \langle \vec {W}, \vec {R}, \vec {V_\varSigma },(w_0) \rangle$$ be a Kripke structure such that
• $$\vec {V_\varSigma }(p) = \{\vec {w} \in \vec {W} \mid \mathsf {trm}(\vec {w}) \in V(p)\}$$ for every propositional symbol $$p\in Q$$, and
• $$\vec {V_\varSigma }(t_\psi ) = \{\vec {w}\in \vec {W}\mid \langle \vec {M}, \vec {w} \rangle \models \psi \}$$ for every $$t_\psi \in T$$.
Then for every $$t_\psi \in T$$ and every world $$\vec {w}\in \vec {W}$$, $$\langle \vec {M}, \vec {w} \rangle \models t_\psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \psi$$.
Proof
Let $$\vec {w}$$ be a world in $$\vec {W}$$. By Lemma 2 for every formula $$\psi$$ over Q, $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \psi$$. By definition of $$\vec {V_\varSigma }$$, for every $$t_\psi \in T$$, $$\langle \vec {M}, \vec {w} \rangle \models t_\psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models \psi$$. So, $$\langle \vec {M}, \vec {w} \rangle \models t_\psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \psi$$.$$\square$$
Lemma 4
Let $$\varPhi$$ be a set of definitional clauses such that every $$t_\psi$$ occurring $$\varPhi$$ is an element of T and all other propositional symbols occurring in $$\varPhi$$ are in Q. Let $$M=\langle W, R, V, w_0 \rangle$$ be a rooted Kripke structure. Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W, R \rangle$$ at $$w_0$$. Let $$\vec {M}= \langle \vec {W}, \vec {R}, \vec {V_\varSigma },(w_0) \rangle$$ be a Kripke structure such that
• $$\vec {V_\varSigma }(p) = \{\vec {w} \in \vec {W} \mid \mathsf {trm}(\vec {w}) \in V(p)\}$$ for every propositional symbol $$p\in Q$$, and
• $$\vec {V_\varSigma }(t_\psi ) = \{\vec {w}\in \vec {W}\mid \langle \vec {M}, \vec {w} \rangle \models \psi \}$$ for every surrogate $$t_\psi \in T\cap \mathsf {var}(\varPhi )$$.
Then $$\vec {M}\models \varPhi$$.
Proof
Let $$T(Q,\varPhi )$$ be the set of all modal formulae over Q such that $$\eta (\psi )\in \mathsf {var}(\varPhi )$$. Let $$\psi \in T(Q,\varPhi )$$. If $$\psi$$ is not literal, then $$\eta (\psi ) = t_\psi$$ for some propositional symbol $$t_\psi \in \mathsf {var}(\varPhi )\setminus Q$$. By Lemma 3, for every world $$\vec {w}\in \vec {W}$$, $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models t_\psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models \eta (\psi )$$. If $$\psi$$ is propositional symbol $$p\in Q$$, then $$\eta (\psi ) = \psi$$ and, trivially, for every world $$\vec {w}\in \vec {W}$$, $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models \eta (\psi )$$. Overall, (15) if $$\psi \in T(Q,\varPhi )$$ and $$\vec {w}\in \vec {W}$$, then $$\langle \vec {M}, \vec {w} \rangle \models \psi$$ iff $$\langle \vec {M}, \vec {w} \rangle \models \eta (\psi )$$.
Let $$S:\psi '$$ be a clause in $$\varPhi$$. We show that $$\vec {M}\models S:\psi '$$. Depending on the form of $$S:\psi '$$ as stated in the lemma, we can distinguish the following cases:
Case (a): Let $$\vec {w}\in \vec {M}[S]$$ with $$\langle \vec {M}, \vec {w} \rangle \models t_{\psi _1\wedge \psi _2}$$. By Lemma 3, this implies $$\langle \vec {M}, \vec {w} \rangle \models \psi _1\wedge \psi _2$$. Since $$\psi _1,\psi _2\in T(Q,\varPhi )$$, by Property (15), $$\langle \vec {M}, \vec {w} \rangle \models \eta (\psi _1)\wedge \eta (\psi _2)$$. This implies $$\langle \vec {M}, \vec {w} \rangle \models \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _i)$$. Thus, $$\vec {M}\models S: \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _i)$$.
Case (b): Let $$\vec {w}\in \vec {M}[S]$$ with $$\langle \vec {M}, \vec {w} \rangle \models t_{\psi _1\vee \psi _2}$$. By Lemma 3, this implies $$\langle \vec {M}, \vec {w} \rangle \models \psi _1\vee \psi _2$$. Since $$\psi _1,\psi _2\in T(Q,\varPhi )$$, by Property (15), $$\langle \vec {M}, \vec {w} \rangle \models \eta (\psi _1)\vee \eta (\psi _2)$$. This implies $$\langle \vec {M}, \vec {w} \rangle \models \lnot t_{\psi _1\vee \psi _2}\vee \eta (\psi _1)\vee \eta (\psi _2)$$. Thus, $$\vec {M}\models S: \lnot t_{\psi _1\vee \psi _2}\vee \eta (\psi _1)\vee \eta (\psi _2)$$.
Case (c): disjunction of literals all of which are in $$\mathsf {var}(\varphi )$$. This case can be proven in analogy to Case (b).
Case (d): Let $$\vec {w}\in \vec {M}[S]$$ with $$\langle \vec {M}, \vec {w} \rangle \models t_{\Box \psi }$$. By Lemma 3, this implies $$\langle \vec {M}, \vec {w} \rangle \models \Box \psi$$. That means for every $$\vec {v}\in \vec {W}$$, if $$\vec {w}\mathbin {\!R}\!\vec {v}$$ then $$\langle \vec {M}, \vec {v} \rangle \models \psi$$. Since $$\psi \in T(Q,\varPhi )$$, by Property (15), this implies for every $$\vec {v}\in \vec {W}$$, if $$\vec {w}\mathbin {\!R}\!\vec {v}$$ then $$\langle \vec {M}, \vec {v} \rangle \models \eta (\psi )$$. By the semantics of $$\Box$$, then $$\langle \vec {M}, \vec {w} \rangle \models \Box \eta (\psi )$$. Thus, $$\vec {M}\models S:t_{\Box \psi }\rightarrow \Box \eta (\psi )$$.
Case (e): Let $$\vec {w}\in \vec {M}[S]$$ with $$\langle \vec {M}, \vec {w} \rangle \models t_{\Diamond \psi }$$. By Lemma 3, this implies $$\langle \vec {M}, \vec {w} \rangle \models \Diamond \psi$$. That means there exists $$\vec {v}\in \vec {W}$$ such that $$\vec {w}\mathbin {\!R}\!\vec {v}$$ and $$\langle \vec {M}, \vec {v} \rangle \models \psi$$. Since $$\psi \in T(Q,\varPhi )$$, by Property (15), this implies $$\langle \vec {M}, \vec {v} \rangle \models \eta (\psi )$$. By the semantics of $$\Diamond$$, then $$\langle \vec {M}, \vec {w} \rangle \models \Diamond \eta (\psi )$$. Thus, $$\vec {M}\models S:t_{\Diamond \psi }\rightarrow \Diamond \eta (\psi )$$.
This covers all possible forms that clauses in $$\varPhi$$ can take and we conclude that $$\vec {M} \models \varPhi$$.$$\square$$
Lemma 5
Let $$\varphi$$ be a L-satisfiable modal formula in simplified NNF where L is a normal modal logic and let $${\varPhi = \{\{0\} : t_\varphi \} \cup \rho _{{{\textsf {\textit{K}}}}}(\{0\} : t_\varphi \rightarrow \varphi )}$$. Let $$M=\langle W, R, V, w_0 \rangle$$ be a rooted $${\textsf {K} }$$ model of $$\varphi$$. Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W,R \rangle$$ at $$w_0$$. Let $$\vec {M} = \langle \vec {W}, \vec {R}, \vec {V},(w_0) \rangle$$ be a Kripke structure such that
• $$\vec {V}(p) = \{\vec {w} \in \vec {W} \mid \mathsf {trm}(\vec {w}) \in V(p)\}$$ for every propositional symbol $$p\in \mathsf {var}(\varphi )$$, and
• $$\vec {V}(t_\psi ) = \{\vec {w}\in \vec {W}\mid \langle \vec {M}, \vec {w} \rangle \models \psi \}$$ for every surrogate $$t_\psi \in T\cap \mathsf {var}(\varPhi )$$.
Then $$\vec {M}\models \varPhi$$.
Proof
Each clause $$S:\psi '$$ in $$\varPhi$$ except for $$\{0\} : t_\varphi$$ is a definitional clause $$S:\lnot t_\psi \vee \eta _f(\psi )$$ with $$t_\psi \in T$$. By Lemma 4, $$\vec {M}\models S:\psi '$$.
Now consider $$\{0\} : t_\varphi$$. As $$\langle M, w_0 \rangle \models \varphi$$ and $$(w_0)\in \vec {M}[0]$$, by Lemma 2, we obtain $$\langle \vec {M}, (w_0) \rangle \models \varphi$$. By Lemma 3, $$\langle \vec {M}, (w_0) \rangle \models \varphi$$ implies $$\langle \vec {M}, (w_0) \rangle \models t_\varphi$$. Thus, $$\vec {M}\models \{0\} : t_\varphi$$.
This covers all possible forms that clauses in $$\varPhi$$ can take and we can conclude that $$\vec {M}\models \varPhi$$.$$\square$$
Lemma 6
Let $$\varphi$$ be a modal formula in simplified NNF. Let $${\varPhi _{{\textsf {\textit{K}}}} = \{\{0\} : t_\varphi \} \cup \rho _{{\textsf {\textit{K}}}}(\{0\} : t_\varphi \rightarrow \varphi )}$$. Let $$\varPhi$$ with $${\varPhi _{{\textsf {\textit{K}}}}\subseteq \varPhi }$$ be a definition-complete set of  $$\textsf {SNF}_{sml}$$ clauses, let $$M = \langle W,R,V,w_0 \rangle$$ be a tree $${\textsf {K} }$$ model of $$\varPhi$$ and let $$M' = \langle W,R',V,w_0 \rangle$$ be such that
(6a)
$$R\subseteq R'$$;

(6b)
for every modal clause $$S: t_{\Box \psi }\rightarrow \Box \eta (\psi )$$ in $$\varPhi$$ and every world $$w\in M[S]$$, $$\langle M', w \rangle \models t_{\Box \psi }\rightarrow \Box \eta (\psi )$$;

(6c)
for every modal clause $$S: t_{\Box \psi }\rightarrow \Box t_\psi$$ in $$\varPhi$$ and all worlds $$v,w\in W$$, if (i)  and (ii) $$w\mathbin {R'}v$$ then (iii) there exists a clause $$S':\lnot t_\psi \vee \eta _f(\psi )$$ in $$\varPhi$$ with $$v\in M[S']$$.

Then $$\langle M', w_0 \rangle \models \varphi$$.
Proof
As M is a model of $$\varPhi$$, (16) for every clause $$S:\psi$$ in $$\varPhi$$ and every world $$w\in M[S]$$, $$\langle M, w \rangle \models \psi$$. Also, as both M and $$M'$$ use the same valuation V and the same set of worlds $$W$$, (17) for every propositional literal l and every world $$w\in W$$, $$\langle M, w \rangle \models l$$ iff $$\langle M', w \rangle \models l$$.
We prove by structural induction on subformulae $$\vartheta$$ of $$\varphi$$ that (18) if $$\eta (\vartheta ) = t_\vartheta$$ for surrogate $$t_\vartheta$$, $$S : \lnot t_\vartheta \vee \eta _f(\vartheta )\in \varPhi$$, and $$w\in M[S]$$ with $$\langle M', w \rangle \models t_\vartheta$$ then $$\langle M', w \rangle \models \vartheta$$.
In the base cases, we have to consider subformulae $$\vartheta$$ that are conjunctions or disjunctions of literals over propositional symbols in $$\mathsf {var}(\varphi )$$.
• Case (1): Let $$\vartheta$$ be of the form $$\psi _1\wedge \psi _2$$, where $$\psi _1$$ and $$\psi _2$$ are literals over $$\mathsf {var}(\varphi )$$, with $$\eta (\psi _1\wedge \psi _2) = t_{\psi _1\wedge \psi _2}$$. As $$\varPhi$$ is definition-complete, there exist literal clauses $$S : \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _1)$$ and $$S : \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _2)$$ in $${\varPhi _{{\textsf {\textit{K}}}}}$$ such that $$\eta (\psi _1) = \psi _2$$ and $$\eta (\psi _2) = \psi _2$$ are literals over $$\mathsf {var}(\varphi )$$. Assume $$w\in M[S]$$ with $$\langle M', w \rangle \models t_{\psi _1\wedge \psi _2}$$.
By Property (17), $$\langle M, w \rangle \models t_{\psi _1\wedge \psi _2}$$. By Property (16), $$\langle M, w \rangle \models \lnot t_{\psi _1\wedge \psi _2}\vee \psi _i$$ for $$1\le i\le 2$$. We therefore have $$\langle M, w \rangle \models \psi _i$$ for $$1\le i\le 2$$. By Property (17), this implies $$\langle M', w \rangle \models \psi _i$$ for $$1\le i\le 2$$. Thus, $$\langle M', w \rangle \models \psi _1\wedge \psi _2$$ by the semantics of conjunction.
• Case (2): Let $$\vartheta$$ be a disjunction of literals over $$\mathsf {var}(\varphi )$$ with $$\eta (\vartheta ) = t_\vartheta$$. As $$\varPhi$$ is definition-complete, there exists a clause $$S : \lnot t_\vartheta \vee \vartheta$$ in $${\varPhi _{{\textsf {\textit{K}}}}}$$. Assume $$w\in M[S]$$ with $$\langle M', w \rangle \models t_\vartheta$$. By Property (17), $$\langle M, w \rangle \models t_\vartheta$$. By Property (16), $$\langle M, w \rangle \models \lnot t_\vartheta \vee \vartheta$$. By the semantics of disjunction, there is a propositional literal l in $$\vartheta$$ such that $$\langle M, w \rangle \models l$$. By Property (17), $$\langle M', w \rangle \models l$$. Thus, $$\langle M', w \rangle \models \vartheta$$ by the semantics of disjunction.
In the induction step, we consider subformulae $$\vartheta$$ of $$\varphi$$ under the induction hypothesis that Property (18) holds for all proper subformulae of $$\vartheta$$.
• Case (3): Let $$\vartheta$$ be of the form $$\psi _1\wedge \psi _2$$ with $$\eta (\psi _1\wedge \psi _2) = t_{\psi _1\wedge \psi _2}$$. As $$\varPhi$$ is definition-complete, there exist clauses $$S : \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _1)$$ and $$S : \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _2)$$ in $$\varPhi$$. Assume $$w\in M[S]$$ with $$\langle M', w \rangle \models t_{\psi _1\wedge \psi _2}$$. By Property (17), $$\langle M, w \rangle \models t_{\psi _1\wedge \psi _2}$$. By Property (16), $$\langle M, w \rangle \models \lnot t_{\psi _1\wedge \psi _2}\vee \eta (\psi _i)$$ for $$1\le i\le 2$$. We therefore have $$\langle M, w \rangle \models \eta (\psi _i)$$, for $$1\le i\le 2$$. As $$\eta (\psi _1)$$ and $$\eta (\psi _2)$$ are literals, by Property (17) and the semantics of conjunction, $$\langle M', w \rangle \models \eta (\psi _1)\wedge \eta (\psi _2)$$. Case (3-a): If $$\psi _i$$, $$1\le i\le 2$$, is a literal, then $$\eta (\psi _i) = \psi _i$$ and we immediately have $$\langle M', w \rangle \models \psi _i$$. Case (3-b): If $$\psi _i$$, $$1\le i\le 2$$, is not a literal, then $$\eta (\psi _i) = t_{\psi _i}$$. Since $$\varPhi$$ is definition-complete, there must be a clause $$S':\lnot t_{\psi _i}\vee \eta _f(\psi _i)$$ in $${\varPhi _{{\textsf {\textit{K}}}}}$$ with $$w\in M[S']$$. Then, by induction hypothesis, $$\langle M', w \rangle \models t_{\psi _i}$$ implies $$\langle M', w \rangle \models \psi _i$$. Taking both cases together $$\langle M', w \rangle \models \psi _1\wedge \psi _2$$.
• Case(4): Let $$\vartheta$$ be of the form $$\psi _1\vee \psi _2$$ where $$\vartheta$$ is not a disjunction of literals and $$\eta (\vartheta ) = t_{\psi _1\vee \psi _2}$$. As $$\varPhi$$ is definition-complete, there exists a clause $$S : \lnot t_{\psi _1\vee \psi _2}\vee \eta (\psi _1)\vee \eta (\psi _2)$$ in $$\varPhi$$. Assume $$w\in M[S]$$ with $$\langle M', w \rangle \models t_{\psi _1\vee \psi _2}$$. By Property (17), $$\langle M, w \rangle \models t_{\psi _1\vee \psi _2}$$. By Property (16), $$\langle M, w \rangle \models \lnot t_{\psi _1\vee \psi _2}\vee \eta (\psi _1)\vee \eta (\psi _2)$$. By the semantics of disjunction, $$\langle M, w \rangle \models \eta (\psi _1)$$ or $$\langle M, w \rangle \models \eta (\psi _2)$$.
As $$\eta (\psi _1)$$ and $$\eta (\psi _2)$$ are literals, by Property (17), $$\langle M', w \rangle \models \eta (\psi _1)$$ or $$\langle M', w \rangle \models \eta (\psi _2)$$. In analogy to Case (3-a): and Case (3-b): above we can show that $$\langle M', w \rangle \models \psi _i$$ for $$i=1$$ or $$i=2$$. This implies $$\langle M', w \rangle \models \psi _1\vee \psi _2$$.
• Case (5): Let $$\vartheta$$ be of the form $$\Box \psi$$ with $$\eta (\Box \psi ) = t_{\Box \psi }$$. As $$\varPhi$$ is definition-complete, there exists a clause $$S : t_{\Box \psi }\rightarrow \Box \eta (\psi )$$ in $$\varPhi$$. Assume $$w\in M[S]$$ (Condition (6c)-i) with $$\langle M', w \rangle \models t_{\Box \psi }$$. By Assumption (6b), $$\langle M', w \rangle \models t_{\Box \psi }\rightarrow \Box \eta (\psi )$$. By semantics of implication, $$\langle M', w \rangle \models \Box \eta (\psi )$$. Also, $$\langle M', w \rangle \models t_{\Box \psi }$$ implies $$\langle M, w \rangle \models t_{\Box \psi }$$. As $$w\in M[S]$$ and M is a model of $$\varPhi$$, $$\langle M, w \rangle \models t_{\Box \psi }\rightarrow \Box \eta (\psi )$$ and by the semantics of implication, $$\langle M, w \rangle \models \Box \eta (\psi )$$. Let $$v\in W$$ with $$w\mathbin {R'}v$$ (Condition (6c)-ii). As $$\langle M', w \rangle \models \Box \eta (\psi )$$, $$\langle M', v \rangle \models \eta (\psi )$$. Case (5-a): If $$\psi$$ is a literal, then $$\eta (\psi ) = \psi$$ and we immediately have $$\langle M', v \rangle \models \psi$$ and as v was an arbitrary $$R'$$-successor of w, $$\langle M', w \rangle \models \Box \psi$$. Case (5-b): If $$\psi$$ is not a literal, then $$\eta (\psi ) = t_{\psi }$$. As Conditions (6c)-i and (6c)-ii hold, by Assumption (6c)-iii there exists a clause $$S':\lnot t_{\psi }\vee \eta _f(\psi )$$ in $$\varPhi$$ with $$v\in M[S']$$. Then, by induction hypothesis, $$\langle M', v \rangle \models t_{\psi }$$ implies $$\langle M', v \rangle \models \psi$$. By semantics of $$\Box$$ we again obtain $$\langle M', w \rangle \models \Box \psi$$.
• Case (6): Let $$\vartheta$$ be of the form $$\Diamond \psi$$ with $$\eta (\Diamond \psi ) = t_{\Diamond \psi }$$. As $$\varPhi$$ is definition-complete, there exists a clause $$S : t_{\Diamond \psi }\rightarrow \Diamond \eta (\psi )$$ in $$\varPhi$$. Assume $$w\in M[S]$$ with $$\langle M', w \rangle \models t_{\Diamond \psi }$$. By Property (17), $$\langle M, w \rangle \models t_{\Diamond \psi }$$. By Assumption (16), $$\langle M, w \rangle \models t_{\Box \psi }\rightarrow \Diamond \eta (\psi )$$. By semantics of implication $$\langle M, w \rangle \models \Diamond \eta (\psi )$$. That means there exists $$v\in W$$ with $$w\mathbin {R}v$$ and $$\langle M, v \rangle \models \eta (\psi )$$. As $$\eta (\psi )$$ is a literal, by Property (17), $$\langle M', v \rangle \models \eta (\psi )$$. As $$R\subseteq R'$$, $$w\mathbin {R}v$$ implies $$w\mathbin {R'}v$$. So there exists $$v\in W$$ with $$w\mathbin {R'}v$$ and $$\langle M', v \rangle \models \eta (\psi )$$ which means $$\langle M', w \rangle \models \Diamond \eta (\psi )$$. Case (6-a): If $$\psi$$ is a literal, then $$\eta (\psi ) = \psi$$ and we immediately have $$\langle M', w \rangle \models \Diamond \psi$$. Case (5-b): If $$\psi$$ is not a literal, then $$\eta (\psi ) = t_{\psi }$$. Since $$\varPhi$$ is definition-complete, there must be a clause $$S':\lnot t_{\psi }\vee \eta _f(\psi )$$ in $$\varPhi$$ with $$v\in M[S']$$. Then, by induction hypothesis, $$\langle M', v \rangle \models t_{\psi }$$ implies $$\langle M', v \rangle \models \psi$$. By semantics of $$\Diamond$$, we then obtain $$\langle M', w \rangle \models \Diamond \psi$$. $$\square$$
Lemma 7
Let $$\varphi$$ be a modal formula in simplified NNF. Let $${\varPhi _{{\textsf {\textit{K}}}} = \{\{0\} : t_\varphi \} \cup \rho _{{\textsf {\textit{K}}}}(\{0\} : t_\varphi \rightarrow \varphi )}$$. Let $$\varPhi$$ with $${\varPhi _{{\textsf {\textit{K}}}}\subseteq \varPhi }$$ be a definition-complete set of $$\textsf {SNF}_{sml}$$ clauses, let $$M = \langle W,R,V,w_0 \rangle$$ be a rooted tree $${\textsf {K} }$$ model of $$\varPhi$$. Then $$\langle M, w_0 \rangle \models \varphi$$.
Proof
It is sufficient to show that if we take $$M' = M$$, then the Kripke structures M and $$M'$$ satisfy the three preconditions of Lemma 6:
• Condition (6a) trivially holds as both models have the same accessibility relation.
• For Condition (6b) let $$S: t_{\Box \psi }\rightarrow \Box \eta (\psi )$$ be a modal clause in $$\varPhi$$ and $$w\in M[S]$$. Then (i) as M is a model of $$\varPhi$$, $$M\models S:t_{\Box \psi }\rightarrow \Box \eta (\psi )$$; (ii) as $$w\in M[S]$$, by definition of $$\models$$, $$\langle M, w \rangle \models t_{\Box \psi }\rightarrow \Box \eta (\psi )$$; (iii) as $$M' = M$$, $$\langle M, w \rangle \models t_{\Box \psi }\rightarrow \Box \eta (\psi )$$ implies $$\langle M', w \rangle \models t_{\Box \psi }\rightarrow \Box \eta (\psi )$$.
• For Condition (6c) let $$S: t_{\Box \psi }\rightarrow \Box t_\psi$$ in $$\varPhi$$, $$w,v\in W$$, $$\mathsf {ml}_{M}(w) = ml \in S$$ (i.e., $$w\in M[S]$$), and $$w\mathbin {R}v$$. As M is a tree model, $$\mathsf {ml}_{M}(v) = ml+1$$. The surrogate $$t_\psi$$ occurs at level $$ml+1$$ in $$\varPhi$$. As $$\varPhi$$ is definition-complete by assumption, there exists a clause $$S': \lnot t_\psi \vee \eta _f(\psi )$$ in $$\varPhi$$ with $$ml+1\in S'$$. Thus, Condition (6c) holds.
By Lemma 6, $$\langle M', w_0 \rangle \models \varphi$$.$$\square$$

### 5.2 Basic Modal Logic $${\textsf {K} }$$

Corollary 1
Let $$\varphi$$ be a modal formula in simplified NNF. Let $$\varPhi _{{\textsf {\textit{K}}}} = \{\{ 0 \}: t_\varphi \} \cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )$$. Let $$M=\langle W, R, V, w \rangle$$ be a rooted Kripke model such that $$\langle M, w \rangle \models \varphi$$. Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W,R \rangle$$ at $$w_0$$. Let $$\vec {M}= \langle \vec {W}, \vec {R}, \vec {V},w_0 \rangle$$ be a Kripke structure such that
• $$\vec {V}(p) = \{\vec {w} \in \vec {W} \mid \mathsf {trm}(\vec {w}) \in V(p)\}$$ for every propositional symbol $$p\in \mathsf {var}(\varphi )$$, and
• $$\vec {V}(t_\psi ) = \{\vec {w}\in W\mid \langle \vec {M}, \vec {w} \rangle \models \psi \}$$ for every surrogate $${t_\psi \in \mathsf {var}(\varPhi _{{\textsf {\textit{K}}}})\setminus \mathsf {var}(\varphi )}$$.
Then $${\vec {M} \models \varPhi _{{\textsf {\textit{K}}}}}$$.
Proof
Follows from Lemma 5 for logic $$L = {\textsf {K} }$$.$$\square$$
Theorem 3
Let $$\varphi$$ be a modal formula in simplified NNF. Let $$\varPhi _{{\textsf {\textit{K}}}} = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )$$. If $${\varPhi _{{\textsf {\textit{K}}}}}$$ is $${\textsf {K} }$$-satisfiable, then $$\varphi$$ is $${\textsf {K} }$$-satisfiable.
Proof
Let $$M = \langle W, R, V,w_0 \rangle$$ be a tree $${\textsf {K} }$$ model of $${\varPhi _{{\textsf {\textit{K}}}}}$$. $${\varPhi _{{\textsf {\textit{K}}}}}$$ is definition-complete by Theorem 2, and, by Lemma 7, it follows that $$\langle M, w_0 \rangle \models \varphi$$.
Correctness proofs for the reductions for $${\textsf {KD} }$$ and $${\textsf {KT} }$$ are straightforward. In the remainder of the section, we consider the reductions for $${\textsf {KB} }$$, $${\textsf {K4} }$$ and $${\textsf {K5} }$$.

### 5.3 Modal Logic $${\textsf {KB} }$$

See [29] for the proofs of the following theorems.
Theorem 4
Let $$\varphi$$ be a modal formula in simplified NNF. Let $$\varPhi _{{{\textsf {\textit{B}}}}} = \{\{0\}: t_\varphi \}\cup \rho _{{{\textsf {\textit{KB}}}}}(\{0\} : t_\varphi \rightarrow \varphi )$$. If $$\varphi$$ is $${\textsf {KB} }$$-satisfiable, then $$\varPhi _{{{\textsf {\textit{B}}}}}$$ is $${\textsf {K} }$$-satisfiable.
Theorem 5
Let $$\varphi$$ be a modal formula in simplified NNF. Let $$\varPhi _{{{\textsf {\textit{B}}}}} = \{\{0\}:t_\varphi \}\cup \rho _{{{\textsf {\textit{KB}}}}}(\{0\}:t_\varphi \rightarrow \varphi )$$. If $${\varPhi _{{{\textsf {\textit{B}}}}}}$$ is $${\textsf {K} }$$-satisfiable, then $$\varphi$$ is $${\textsf {KB} }$$-satisfiable.

### 5.4 Modal Logic $${\textsf {K4} }$$

Theorem 6
Let $$\varphi$$ be a modal formula in simplified NNF. Let $$\varPhi _{{\textsf {\textit{4}}}} = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K4}}}}(\{0\}:t_\varphi \rightarrow \varphi )$$. If $$\varphi$$ is $${\textsf {K4} }$$-satisfiable, then $${\varPhi _{{\textsf {\textit{4}}}}}$$ is $${\textsf {K} }$$-satisfiable.
Proof
Let $$M = \langle W,R,V,w_0 \rangle$$ be a rooted model of $$\varphi$$ with $$\langle M, w_0 \rangle \models \varphi$$ and transitive relationship $$R$$.
Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W,R \rangle$$ at $$w_0$$. The function $$\mathsf {trm}$$ is a p-morphism from $$\langle \vec {W},\vec {R} \rangle$$ to $$\langle W,R \rangle$$. Let $${\vec {M}_{{\textsf {\textit{4}}}} = \langle \vec {W},\vec {R}, \vec {V_{{\textsf {\textit{4}}}}},(w_0) \rangle }$$ where
• $${\vec {V_{{\textsf {\textit{4}}}}}(p) = \vec {V}(p)}$$ for every propositional symbol $$p\in \mathsf {var}(\varphi )$$,
• $${\vec {V_{{\textsf {\textit{4}}}}}(t_\psi ) = \{\vec {w}\in \vec {W}\mid \langle \vec {M}_{{\textsf {\textit{4}}}}, \vec {w} \rangle \models \psi \}}$$ for every surrogate $${t_\psi \in \mathsf {var}(\varPhi _{{\textsf {\textit{4}}}})\setminus \mathsf {var}(\varphi )}$$ introduced by $${\rho _{{\textsf {\textit{K4}}}}}$$.
We show that all clauses in $${\varPhi _{{\textsf {\textit{4}}}}}$$ hold in $${\vec {M}_{{\textsf {\textit{4}}}}}$$.
Let $${\varPhi = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. By Lemma 1, $${\varPhi \subseteq \varPhi _{{\textsf {\textit{4}}}}}$$, and by Lemma 5, $${\vec {M}_{{\textsf {\textit{4}}}}\models \varPhi }$$.
All definitional clauses in $${\varPhi _{{\textsf {\textit{4}}}}\setminus \varPhi }$$ are true in $${\vec {M}_{{\textsf {\textit{4}}}}}$$ by Lemma 4. It remains to consider clauses of the form (19) $${S':t_{\Box \psi }\rightarrow \Box t_{\Box \psi }}$$. Let $$\vec {w}\in \vec {W}[S']$$ with $${\langle \vec {M}_{{\textsf {\textit{4}}}}, \vec {w} \rangle \models t_{\Box \psi }}$$. Then $${\vec {w}\in \vec {V}_{{\textsf {\textit{4}}}}(t_{\Box \psi })}$$ and by definition of $${\vec {V}_{{\textsf {\textit{4}}}}}$$, $${\langle \vec {M}_{{\textsf {\textit{4}}}}, \vec {w} \rangle \models \Box \psi }$$. Let $$\vec {u}\in \vec {W}$$ such that $$\vec {w}\vec {R}\vec {u}$$. By Lemma 2, $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Box \psi$$. Since $$\mathsf {trm}$$ is a p-morphism $$\mathsf {trm}(\vec {w})\mathbin {\!R}\mathsf {trm}(\vec {u})$$. As $$\Box$$ is a $${\textsf {K4} }$$ modality, $$\langle M, \mathsf {trm}(\vec {u}) \rangle \models \Box \psi$$ and by Lemma 2, $${\langle \vec {M}_{{\textsf {\textit{4}}}}, \vec {u} \rangle \models \Box \psi }$$. By definition of $${\vec {V}_{{\textsf {\textit{4}}}}}$$, $${\vec {u}\in \vec {V}_{{\textsf {\textit{4}}}}(t_{\Box \psi })}$$ and $${\langle \vec {M}_{{\textsf {\textit{4}}}}, \vec {u} \rangle \models t_{\Box \psi }}$$. As $$\vec {u}\in \vec {W}$$ was an arbitrary world with $$\vec {w}\vec {R}\vec {u}$$, we have $${\langle \vec {M}_{{\textsf {\textit{4}}}}, \vec {w} \rangle \models \Box t_{\Box \psi }}$$. Thus, Clause (19) holds in $${\vec {M}_{{\textsf {\textit{4}}}}}$$.$$\square$$
Theorem 7
Let $$\varphi$$ be a modal formula. Let $${\varPhi _{{\textsf {\textit{4}}}} = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K4}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. If $${\varPhi _{{\textsf {\textit{4}}}}}$$ is $${\textsf {K} }$$-satisfiable, then $$\varphi$$ is $${\textsf {K4} }$$-satisfiable.
Proof
Let $$M = \langle W,R,V,w_0\rangle$$ be a rooted tree $${\textsf {K} }$$ model of $${\varPhi _{{\textsf {\textit{4}}}}}$$. Let be a Kripke structure such that
(a)
$${R^{{\textsf {\textit{4}}}}}$$ is the transitive closure of $$R$$, that is, $${R^{{\textsf {\textit{4}}}}}$$ is the smallest relation on $$W$$ such that $${R\subseteq R^{{\textsf {\textit{4}}}}}$$ and for every uvw, $${u\mathbin {\!R^{{\textsf {\textit{4}}}}}v}$$ and $${v\!\mathbin {R^{{\textsf {\textit{4}}}}\!}w}$$ implies $${u\!\mathbin {R^{{\textsf {\textit{4}}}}\!}w}$$;

(b)
$${V^{{\textsf {\textit{4}}}}(p) = V(p)}$$ for every propositional symbol.

Let $${\varPhi = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. We show that $${M^{{\textsf {\textit{4}}}}}$$ satisfies the three preconditions of Lemma 6. By Lemma 6 this in turn implies that $${M^{{\textsf {\textit{4}}}}\models \varphi }$$.
• Condition (6a) holds as $${R\subseteq R^{{\textsf {\textit{4}}}}}$$.
• For Condition (6b) let (20) $${S':t_{\Box \psi }\rightarrow \Box \eta (\psi )}$$ be a modal clause in $${\varPhi _{{\textsf {\textit{4}}}}}$$. $${\varPhi _{{\textsf {\textit{4}}}}}$$ also contains the clause (21) $${S':t_{\Box \psi }\rightarrow \Box t_{\Box \psi }}$$. By definition of $${\rho _{{\textsf {\textit{K4}}}}}$$, for all $$n\ge \mathsf {min}(S')$$, $$n\in S'$$. Let $$w\in M[S']$$ such that $${\langle M^{{\textsf {\textit{4}}}}, w \rangle \models t_{\Box \psi }}$$. By Clause (20), $${\langle M^{{\textsf {\textit{4}}}}, w \rangle \models \Box \eta (\psi )}$$ should hold. Assume $${\langle M^{{\textsf {\textit{4}}}}, w \rangle \not \models \Box \eta (\psi )}$$, that is, there exists $$v\in W$$ with $$w R^{4}v$$ and $${\langle M^{{\textsf {\textit{4}}}}, v \rangle \not \models \eta (\psi )}$$. As $${V = V^{{\textsf {\textit{4}}}}}$$, $$\langle M, w \rangle \models t_{\Box \psi }$$ and by Clause (20) which is true in $$M$$, $$\langle M, w \rangle \models \Box \eta (\psi )$$. Thus, for every world $$u\in W$$, if wRu then $$\langle M, u \rangle \models \eta (\psi )$$. $$\eta (\psi )$$ is either a propositional symbol or its negation. As $${V = V^{{\textsf {\textit{4}}}}}$$, $$\langle M, u \rangle \models \eta (\psi )$$ iff $${\langle M^{{\textsf {\textit{4}}}}, u \rangle \models \eta (\psi )}$$. That means wRv cannot hold. Consequently, $${w\!\mathbin {R^{{\textsf {\textit{4}}}}}\!v}$$ was introduced by the closure operation on $$R$$. This in turn implies that there exist $$v_0,\ldots ,v_m$$, $$m > 1$$, such that $$v_0=u$$, $$v_m=v$$, for every i, $$1\le i\le m$$, $$v_{i-1}\mathbin {R}v_i$$ holds, $${\langle M^{{\textsf {\textit{4}}}}, v_0 \rangle \models t_{\Box \psi }}$$, and $${\langle M^{{\textsf {\textit{4}}}}, v_m \rangle \not \models \eta (\psi )}$$. Note that (22) for every i, $$0\le i\le m$$, $$v_i\in M[S']$$. Since $$\langle M, v_0 \rangle \models t_{\Box \psi }$$, using Clause (21) and Property (22), by induction, we can show that for every i, $$0\le i\le m$$, $$\langle M, v_i \rangle \models t_{\Box \psi }$$. From $$\langle M, v_{m-1} \rangle \models t_{\Box \psi }$$, $$v_{m-1}\in M[S']$$ and Clause (20), we then obtain $$\langle M, v_m \rangle \models \eta (\psi )$$. As $${V = V^{{\textsf {\textit{4}}}}}$$, $$\langle M, v_m \rangle \models \eta (\psi )$$ iff $${\langle M^{{\textsf {\textit{4}}}}, v_m \rangle \models \eta (\psi )}$$. This contradicts $${\langle M^{{\textsf {\textit{4}}}}, v_m \rangle \not \models \eta (\psi )}$$.
• For Condition (6c) let (23) $${S:t_{\Box \psi }\rightarrow \Box t_\psi }$$ be in $${\varPhi _{{\textsf {\textit{4}}}}}$$, $$v,w\in W$$, $$\mathsf {ml}_{M}(w) = ml \in S$$ (i.e., $$w\in M[S]$$) and $${w\!\mathbin {R^{{\textsf {\textit{4}}}}}\!v}$$. We need to show that there exists a clause $$S':\lnot t_\psi \vee \eta _f(\psi )$$ in $${\varPhi _{{\textsf {\textit{4}}}}}$$ with $$v\in M[S']$$. As in the previous case, $${w\mathbin {\!R^{{\textsf {\textit{4}}}}}v}$$ means that there exist $$v_0,\ldots ,v_m$$, $$m > 1$$, such that $$v_0=w$$, $$v_m=v$$, and for every i, $$1\le i\le m$$, $$v_{i-1}\mathbin {\!R}v_i$$ holds. Then $$\mathsf {ml}_{M}(v) = \mathsf {ml}_{M}(v_m) = \mathsf {ml}_{M}(v_0)+m = \mathsf {ml}_{M}(w)+m$$. By definition of $${\rho _{{\textsf {\textit{K4}}}}}$$, for all $$n\ge \textsf {min}(S)$$, $$n\in S$$. That means $${\varPhi _{{\textsf {\textit{4}}}}}$$ contains $$t_\psi$$ at every level $$ml'\ge \textsf {min}(S)\ge ml$$. This includes $$ml' {=} \mathsf {ml}_{M}(w)+m {=} \mathsf {ml}_{M}(v)$$. By Theorem 2, $${\varPhi _{{\textsf {\textit{4}}}}}$$ is definition-complete and therefore there exists a clause $$S':\lnot t_\psi \vee \eta _f(\psi )$$ in $${\varPhi _{{\textsf {\textit{4}}}}}$$ with $$ml'\in S'$$ and $$v\in M[S']$$.$$\square$$

### 5.5 Modal Logic $${\textsf {K5} }$$

Theorem 8
Let $$\varphi$$ be a modal formula. Let $${\varPhi _5 = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K5}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. If $$\varphi$$ is $${\textsf {K5} }$$-satisfiable, then $$\varPhi _5$$ is $${\textsf {K} }$$-satisfiable.
Proof
Let $$M = \langle W,R,V,w_0 \rangle$$ be a model of $$\varphi$$ with $$\langle M, w_0 \rangle \models \varphi$$ and Euclidean relation $$R$$.
Let $$\langle \vec {W},\vec {R} \rangle$$ be the unraveling of $$\langle W,R \rangle$$ at $$w_0$$. The function $$\mathsf {trm}$$ is a p-morphism from $$\langle \vec {W},\vec {R} \rangle$$ to $$\langle W,R \rangle$$. Let $${\vec {M}_{{\textsf {\textit{5}}}} =\langle \vec {W},\vec {R}, \vec {V}_{{\textsf {\textit{5}}}},(w_0) \rangle }$$ where
• $${\vec {V}_{{\textsf {\textit{5}}}}(p) = \vec {V}(p)}$$ for every propositional symbol $$p\in \mathsf {var}(\varphi )$$,
• $${\vec {V}_{{\textsf {\textit{5}}}}(t_\psi ) = \{\vec {w}\in \vec {W}\mid \langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \psi \}}$$ for every surrogate $${t_\psi \in \mathsf {var}(\varPhi _{{\textsf {\textit{5}}}})\setminus \mathsf {var}(\varphi )}$$ introduced by rewriting, and
• $${\vec {V}_{{\textsf {\textit{5}}}}(t_{\Diamond t_{\Box \psi }}) = \{\vec {w}\in \vec {W}\mid \langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Diamond \!\Box \!\psi \}}$$ for every supplementary propositional symbol $${t_{\Diamond t_{\Box \psi }}\in \mathsf {var}(\varPhi _{{\textsf {\textit{5}}}})\setminus \mathsf {var}(\varphi )}$$ introduced by rewriting.
We show that all clauses in $$\varPhi _5$$ hold in $${\vec {M}_{{\textsf {\textit{5}}}}}$$.
Let $${\varPhi = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. By Lemma 1, $$\varPhi \subseteq \varPhi _5$$, and by Lemma 5, $${\vec {M}_{{\textsf {\textit{5}}}}\models \varPhi }$$. All definitional clauses in $${\varPhi _{{\textsf {\textit{5}}}}\setminus \varPhi }$$ are true in $${\vec {M}_{{\textsf {\textit{5}}}}}$$ by Lemma 4.
Next consider clauses of the form
involving supplementary propositional symbols. These are not in $$\varPhi$$. Let $$\vec {w}\in \vec {W}$$ such that $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models t_{\Diamond t_{\Box \psi }}}$$. Then $${\vec {w}\in \vec {V}_{{\textsf {\textit{5}}}}(t_{\Diamond t_{\Box \psi }})}$$ and by definition of $${\vec {V}_{{\textsf {\textit{5}}}}}$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Diamond \!\Box \!\psi }$$. By semantics of $$\Diamond$$, there exists $$\vec {u}\in W$$ such that $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \models \Box \psi }$$. By definition of $${\vec {V}_{{\textsf {\textit{5}}}}}$$, $${\vec {u}\in \vec {V}_{{\textsf {\textit{5}}}}(t_{\Box \psi })}$$ and so $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \models t_{\Box \psi }}$$. By semantics of $$\Diamond$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Diamond t_{\Box \psi }}$$. Thus, Clause (24) holds in $${\vec {M}_{{\textsf {\textit{5}}}}}$$.
By Lemma 2, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Diamond \!\Box \!\psi }$$ iff $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Diamond \!\Box \!\psi$$. As $$\Diamond$$ and $$\Box$$ are $${\textsf {K5} }$$ modal operators, $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Diamond \!\Box \!\psi$$ implies $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Box \psi$$. By Lemma 2, $$\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Box \psi$$. By definition of $${\vec {V}_{{\textsf {\textit{5}}}}}$$, $${\vec {w}\in \vec {V}_{{\textsf {\textit{5}}}}(t_{\Box \psi })}$$ and $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models t_{\Box \psi }}$$. So, Clause (26) holds in $${\vec {M}_{{\textsf {\textit{5}}}}}$$.
As we have seen, if $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models t_{\Diamond t_{\Box \psi }}}$$ then $${\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Diamond \!\Box \!\psi }$$ As $$\Diamond$$ and $$\Box$$ are $${\textsf {K5} }$$ modal operators, this implies $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Box \!\!\Diamond \!\!\Box \psi$$. By Lemma 2, $$\langle M, \mathsf {trm}(\vec {w}) \rangle \models \Box \!\!\Diamond \!\!\Box \psi$$ iff $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Box \!\Diamond \!\Box \psi }$$. By the semantics of $$\Box$$, for every $${\vec {u}\in \vec {V}_{{\textsf {\textit{5}}}}}$$, if $$\vec {w}\vec {R}\vec {u}$$ then $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \models \Diamond \!\Box \!\psi }$$. By definition of $${\vec {V}_{{\textsf {\textit{5}}}}}$$, $${\vec {u}\in \vec {V}_{{\textsf {\textit{5}}}}(t_{\Diamond t_{\Box \psi }})}$$. Again, by semantics of $$\Box$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Box t_{\Diamond t_{\Box \psi }}}$$. Thus, Clause (27) holds in $${\vec {M}_{{\textsf {\textit{5}}}}}$$.
For Clause (25), we have to consider a world $$\vec {w}\in \vec {W}$$ such that $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \lnot t_{\Diamond t_{\Box \psi }}}$$. Then $${\vec {w}\not \in \vec {V}_{{\textsf {\textit{5}}}}(t_{\Diamond t_{\Box \psi }})}$$ and by definition of $${\vec {V}_{{\textsf {\textit{5}}}}}$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \not \models \Diamond \!\Box \!\psi }$$. By the semantics of $$\Diamond$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Box \lnot \!\Box \!\psi }$$. By the semantics of $$\Box$$, for every $$\vec {u}\in \vec {W}$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \models \lnot \!\Box \!\psi }$$, that is, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \not \models \Box \psi }$$. By the definition of $${\vec {V}_{{\textsf {\textit{5}}}}}$$, $${\vec {u}\not \in \vec {V}_{{\textsf {\textit{5}}}}(t_{\Box \psi })}$$ and therefore $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \not \models t_{\Box \psi }}$$ and $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {u} \rangle \models \lnot t_{\Box \psi }}$$. By the semantics of $$\Box$$, $${\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \Box \lnot t_{\Box \psi }}$$. So, we have $$\langle \vec {M}_{{\textsf {\textit{5}}}}, \vec {w} \rangle \models \lnot t_{\Diamond t_{\Box \psi }}\rightarrow \Box \lnot t_{\Box \psi }$$. Thus, Clause (25) holds in $${\vec {M}_{{\textsf {\textit{5}}}}}$$.$$\square$$
Theorem 9
Let $$\varphi$$ be a modal formula. Let $${\varPhi _{{\textsf {\textit{5}}}} = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K5}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. If $${\varPhi _{{\textsf {\textit{5}}}}}$$ is $${\textsf {K} }$$-satisfiable, then $$\varphi$$ is $${\textsf {K5} }$$-satisfiable.
Proof
Let $$M = \langle W,R,V,w_0 \rangle$$ be a rooted tree $${\textsf {K} }$$ model of $${\varPhi _{{\textsf {\textit{5}}}}}$$. Let $${M^{{\textsf {\textit{5}}}} = \langle W,R^{{\textsf {\textit{5}}}}, V^{{\textsf {\textit{5}}}},w_0\rangle }$$ be a Kripke structure such that
(a)
$${R^{{\textsf {\textit{5}}}}}$$ is the Euclidean closure of $$R$$, that is, $${R^{{\textsf {\textit{5}}}}}$$ is the smallest relation on $$W$$ such that $${R\subseteq R^{{\textsf {\textit{5}}}}}$$ and for every uvw, $${u\!\mathbin {R^{{\textsf {\textit{5}}}}}\!v}$$ and $${u\!\mathbin {R^{{\textsf {\textit{5}}}}}\!w}$$ implies $${v\!\mathbin {R^{{\textsf {\textit{5}}}}}\!w}$$;

(b)
$${V^{{\textsf {\textit{5}}}}(p) = V(p)}$$ for every propositional symbol.

Let $${\varPhi = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K}}}}(\{0\}:t_\varphi \rightarrow \varphi )}$$. We show that $${M^{{\textsf {\textit{5}}}}}$$ satisfies the three preconditions of Lemma 6. By Lemma 6 this in turn implies that $${M^{{\textsf {\textit{5}}}}\models \varphi }$$.
• Condition (6a) holds as $${R\subseteq R^{{\textsf {\textit{5}}}}}$$.
• For Condition (6b) let (28) $${{\star }:t_{\Box \psi } \rightarrow \Box \eta (\psi )}$$ be a modal clause in $${\varPhi _{{\textsf {\textit{5}}}}}$$. Then $${\varPhi _{{\textsf {\textit{5}}}}}$$ also contains the clauses Let $$w\in W$$ such that $${\langle M^{{\textsf {\textit{5}}}}, w \rangle \models t_{\Box \psi }}$$. By Clause (28), $${\langle M^{{\textsf {\textit{5}}}}, w \rangle \models \Box \eta (\psi )}$$ should hold. Assume $${\langle M^{{\textsf {\textit{5}}}}, w \rangle \not \models \Box \eta (\psi )}$$, that is, there exists $$v\in W$$ with $${w\!\mathbin {R^{{\textsf {\textit{5}}}}}\!v}$$ and $${\langle M^{{\textsf {\textit{5}}}}, v \rangle \not \models \eta (\psi )}$$. As $${V^{{\textsf {\textit{5}}}} = V}$$, $${\langle M^{{\textsf {\textit{5}}}}, w \rangle \models t_{\Box \psi }}$$ implies $$\langle M, w \rangle \models t_{\Box \psi }$$ and since Clause (28) is true in M, $$\langle M, w \rangle \models \Box \eta (\psi )$$. By semantics of $$\Box$$, for every world $$u\in W$$ if wRu then $$\langle M, u \rangle \models \eta (\psi )$$. As $$\eta (\psi )$$ is a propositional literal and $${V^{{\textsf {\textit{5}}}} = V}$$ $$\langle M, u \rangle \models \eta (\psi )$$ implies $${\langle M^{{\textsf {\textit{5}}}}, u \rangle \models \eta (\psi )}$$. Thus, v must be a world such that $$w\!\mathbin {R}\!v$$ does not hold. So, $${w\!\mathbin {R^{{\textsf {\textit{5}}}}}\!v}$$ was introduced by the closure operation on $$R$$. This in turn means that there exist $$u,v_0,\ldots ,v_m,w'_0,\ldots ,w'_n,\in W$$, $$m,n\ge 1$$, such that $$v_0=u$$, $$v_m=v$$, $$w'_0=u$$, $$w'_n=w$$, for every i, $$1\le i\le m$$, $$v_{i-1}\mathbin {R}v_i$$ holds, for every j, $$1\le j\le n$$, $$w'_{j-1}\mathbin {R}w'_j$$ holds, $$\langle M, w_n \rangle \models t_{\Box \psi }$$, $$\langle M, v_m \rangle \not \models \eta (\psi )$$, and $$w_n\mathbin {\!R}\!v_m$$ does not hold. W.l.o.g. let the sequences be such that $$m+n$$ is minimal among all the sequences we could choose. Because $$v_{m-1}\mathbin {\!R}\!v_m$$ and $$\langle M, v_m \rangle \not \models \eta (\psi )$$, we have (33) $${\langle M, v_{m-1} \rangle \not \models \Box \eta (\psi )}$$. By Clause (28), $$\langle M, v_{m-1} \rangle \models t_{\Box \psi } \rightarrow \Box \eta (\psi )$$ and with Property (33) we then obtain (34) . Clause (29) $${\star }:t_{\Diamond t_{\Box \psi }}\rightarrow t_{\Box \psi }$$ implies that $$\langle M, v_{m-1} \rangle \models \lnot t_{\Diamond t_{\Box \psi }}\vee t_{\Box \psi }$$ and with Property (34), we have $$\langle M, v_{m-1} \rangle \models \lnot t_{\Diamond t_{\Box \psi }}$$. By Clause (32), for every i, $$0\le i\le m$$, $$\langle M, v_i \rangle \models \lnot t_{\Diamond t_{\Box \psi }}\vee \Box t_{\Diamond t_{\Box \psi }}$$, which allows us, by induction, to establish that for every i, $$0\le i\le {m-1}$$, $$\langle M, v_i \rangle \models \lnot t_{\Diamond t_{\Box \psi }}$$. Since $$v_0=u=w'_0$$, $$\langle M, w'_0 \rangle \models \lnot t_{\Diamond t_{\Box \psi }}$$. Because $$w'_{n-1}Rw_{n}^{'}$$ and $$\langle M, w_n \rangle \models t_{\Box \psi }$$, we have $$\langle M, w'_{n-1} \rangle \models \Diamond t_{\Box \psi }$$. Clause (30) $${\star }:\lnot t_{\Diamond t_{\Box \psi }}\rightarrow \Box \lnot t_{\Box \psi }$$ implies $$\langle M, w'_{n-1} \rangle \models t_{\Diamond t_{\Box \psi }}\vee \Box \lnot t_{\Box \psi }$$ and with $$\langle M, w'_{n-1} \rangle \models \lnot \Box \lnot t_{\Box \psi }$$ we obtain $$\langle M, w'_{n-1} \rangle \models t_{\Diamond t_{\Box \psi }}$$. Clause (29)  $${\star }:t_{\Diamond t_{\Box \psi }}\rightarrow t_{\Box \psi }$$ then gives us $$\langle M, w'_{n-1} \rangle \models t_{\Box \psi }$$. Using Clauses (29) and (30), we can then inductively show that for every j, $$0\le j\le {n-1}$$, $$\langle M, w'_j \rangle \models t_{\Diamond t_{\Box \psi }}$$. Consequently, $$\langle M, w'_0 \rangle \models t_{\Diamond t_{\Box \psi }}$$ holds, contradicting $$\langle M, w'_0 \rangle \models \lnot t_{\Diamond t_{\Box \psi }}$$.
• For Condition (6c) let (35) $${{\star }:t_{\Box \psi }\rightarrow \Box t_\psi }$$ be in $${\varPhi _{{\textsf {\textit{5}}}}}$$, $$v,w\in W$$, $$\mathsf {ml}_{M}(w) = ml \in S$$ (i.e., $$w\in M[S]$$) and $${w\!\mathbin {R^{{\textsf {\textit{5}}}}}\!v}$$. We need to show that there exists a clause $$S':\lnot t_\psi \vee \eta _f(\psi )$$ in $${\varPhi _{{\textsf {\textit{5}}}}}$$ with $$v\in M[S']$$. This is straightforward here as by definition of $${\rho _{{\textsf {\textit{K5}}}}}$$ the definitional clause for $$t_\psi$$ in $${\varPhi _{{\textsf {\textit{5}}}}}$$ has the form $${\star }:\lnot t_\psi \vee \eta _f(\psi )$$ and $$v\in M[{\star }]$$ trivially holds.$$\square$$

### 5.6 Summary

Theorem 10
Let $$\varphi$$ be a modal formula in simplified NNF, $$L\in \{{\textsf {K} }, {\textsf {KB} }, {\textsf {KD} }, {\textsf {KT} },{\textsf {K4} },{\textsf {K5} }\}$$, and $$\varPhi _L = \{\{ 0 \}: t_\varphi \}\cup \rho _{L}(\{0\}:t_\varphi \rightarrow \varphi )$$. Then $$\varphi$$ is $${\textsf {L} }$$-satisfiable iff $$\varPhi _{L}$$ is $${\textsf {K} }$$-satisfiable.
Proof
Follows from Corollary 1, [21, Theorem 5.2], Theorems 4, 5, 6, 7, 8, 9 for the logics $${\textsf {KB} }$$, $${\textsf {K4} }$$, $${\textsf {K5} }$$, and corresponding results for the logics $${\textsf {KD} }$$ and $${\textsf {KT} }$$.

## 6 From $$\textsf {SNF}_{sml}$$ to $$\textsf {SNF}_{ml}$$ Using Bounds

As $${\text {K}_{\text {S}}}{\text {P}}$$ does not support $$\textsf {SNF}_{sml}$$, in our evaluation of the effectiveness of the reductions defined in Sect. 4, we have used a transformation from $$\textsf {SNF}_{sml}$$ to $$\textsf {SNF}_{ml}$$. For $${\textsf {KD} }$$, $${\textsf {KT} }$$, $${\textsf {KB} }$$ such a transformation is straightforward as the sets of modal levels occurring in the normal form of modal formulae are all finite. Thus, instead of a single $$\textsf {SNF}_{sml}$$ clause $$S:\lnot t_\psi \vee \eta _f(\psi )$$, we can use the finite set of $$\textsf {SNF}_{ml}$$ clauses $$\{ml:\lnot t_\psi \vee \eta _f(\psi )\;|\;ml\in S\}$$.
However, for $${\textsf {K4} }$$ and $${\textsf {K5} }$$ the sets of modal levels labeling clauses are in general not finite. But just as in first-order clausal logic where for every unsatisfiable clause set, there exists a finite subset of its Herbrand expansion that is unsatisfiable, for every unsatisfiable set of $$\textsf {SNF}_{sml}$$ clauses $$\varPhi$$, there exists an unsatisfiable set of $$\textsf {SNF}_{sml}$$ clauses $$\varPhi ' = \{S':C\;|\;S:C\in \varPhi \}$$ such that all sets of modal levels $$S'$$ are finite. The question is whether there is a computable function that can generate $$\varPhi '$$ from $$\varPhi$$.
This is indeed the case. For $${\textsf {K4} }$$, we can take advantage of a bound established by Massacci [18] on the length of prefixes in SST depending on the modal formula $$\varphi$$ under consideration. We can use that bound to limit the maximal modal level occurring in a set of modal levels S labeling $$\textsf {SNF}_{sml}$$ clauses. As all such sets are finite we can straightforwardly use a finite set of $$\textsf {SNF}_{ml}$$ clauses instead. In order to establish that this approach preserves completeness, we show that for every closed tableaux for a modal formula $$\varphi$$ in simplified NNF in the SST (SST) calculus with prefixes limited by Massacci’s bound, we can construct a resolution refutation from a set of $$\textsf {SNF}_{ml}$$ clauses for $$\varphi$$ where modal levels are subject to a corresponding bound. Completeness then follows from Massacci’s result that the SST calculus with that bound is still refutationally complete.
Formally, the SST calculus uses prefixed formulae, that is, pairs $$\sigma : \varphi$$, where the prefix $$\sigma$$ is a non-empty sequence of natural numbers and $$\varphi$$ is a modal formula. Intuitively, $$\sigma$$ “names” a world that satisfies $$\varphi$$. In the following, $$\sigma$$ is a prefix, $$\sigma _0 . \sigma _1$$ the concatenation of the sequence $$\sigma _0$$ with the sequence $$\sigma _1$$ and $$\sigma .n$$ the concatenation of $$\sigma$$ with n. If $$\sigma = n_1 . n_2 . \ldots . n_{k-1} . n_k$$ is a prefix, the length of the prefix $$\sigma$$ is k and is denoted by $$|\sigma |$$. For a logic L, an L-tableau $$\mathscr {T}$$ in the SST calculus is a (binary) tree where each node is labeled with a prefixed formula. Nodes other than the root node are labeled with a second prefixed formula, its premise, and with the name of the SST rule that was applied to the premise to obtain the formula labeling the node. An L-tableau $$\mathscr {T}$$ is an L-tableau for the modal formula $$\varphi$$ if the root of $$\mathscr {T}$$ is labeled with $$1:\varphi$$. An L-branch $$\mathscr {B}$$ is a path from the root to a leaf while a partial L-branch $$\mathscr {B}$$ is path from the root to some node in the tree. Given a partial L-branch $$\mathscr {B} = (m_0,\ldots ,m_k)$$ and a path $$\mathcal {P} = (n_1,\ldots ,n_l)$$ in $$\mathscr {T}$$ such that $$n_1$$ is a child of $$m_k$$, then $$\mathscr {B}\circ \mathcal {P}$$ denotes the partial L-branch $$\mathscr {B}' = (m_0,\ldots ,m_k,n_1,\ldots ,n_l)$$. The SST rules for $${\textsf {K4} }$$ consist of ($$\alpha$$), ($$\beta$$), ($$\pi$$), (K) and (4) in Table 4 while the SST rules for $${\textsf {K5} }$$ consist of ($$\alpha$$), ($$\beta$$), ($$\pi$$), (K), ($$4^{R}$$), ($$4^{D}$$) and ($$Cxt^{1}$$). Nodes are added to a tableau $$\mathscr {T}$$ and labeled as follows: if the antecedent $$\sigma :\psi$$ of a SST rule (r) labels a node on a branch $$\mathscr {B}$$, then we extend the branch with nodes labeled with the consequents of the rule and each of those nodes is labeled with $$\sigma :\psi$$ as premise and (r) as the rule that was applied to create the nodes. Note that rules (K) and (4) can only be applied to a formula $$\sigma :\Box \varphi$$ if a prefix $$\sigma .n$$, introduced by an application of rule $$(\pi )$$, is already present in a branch. Analogously, for rule $$4^{D}$$. By a systematic tableau construction, we mean an application of the procedure in [11, p. 374] adapted to SST rules.
A prefixed formula $$\sigma :\varphi$$ is in a branch $$\mathscr {B}$$, denoted by $$\sigma :\varphi \in \mathscr {B}$$, if there is a node in $$\mathscr {B}$$ labeled with $$\sigma :\varphi$$. A prefix is present in a branch $$\mathscr {B}$$ if there is a prefixed formula in $$\mathscr {B}$$ with that prefix, and it is new if it is not present. A branch $$\mathscr {B}$$ is closed if there is a prefix $$\sigma$$ such that either (i) $$\sigma :\mathbf{false}$$ is present in $$\mathscr {B}$$ or (ii) for some propositional symbol p, both $$\sigma : p$$ and $$\sigma : \lnot p$$ are present in $$\mathscr {B}$$. A tableau is closed if every branch is closed. A prefixed formula $$\sigma : \varphi$$ is reduced for rule (r) in $$\mathscr {B}$$, if (r) has the form $$\sigma : \varphi / \sigma ' : \varphi '$$ and $$\sigma ' : \varphi '$$ is in $$\mathscr {B}$$; if (r) has the form $$\sigma : \varphi / \sigma _1 : \varphi _1 | \sigma _2 : \varphi _2$$ and at least one of $$\sigma _1 : \varphi _1$$ and $$\sigma _2 : \varphi _2$$ is in $$\mathscr {B}$$.
Table 4
Single Step Tableaux rules for $${\textsf {K4} }$$ and $${\textsf {K5} }$$
By $${\mathscr {B}|^\mathsf{p}_{\sigma }}$$, $${\mathscr {B}|^\mathsf{m}_{\sigma }}$$, and $${\mathscr {B}|^\mathsf{a}_{\sigma }}$$, we denote the sets $$\{l|l\in L_{P},\sigma :l\in \mathscr {B}\}$$, $$\{\Diamond l|l\in L_{P},\sigma :\Diamond l\in \mathscr {B}\}\cup \{\Box l|l\in L_{P},\sigma :\Box l\in \mathscr {B}\}$$, and $${\mathscr {B}|^\mathsf{p}_{\sigma }}\cup {\mathscr {B}|^\mathsf{m}_{\sigma }}$$, respectively.
For a modal formula $$\varphi$$ in simplified NNF let $$d^\varphi _\Diamond$$ be the maximal nesting of $$\Diamond$$-operators not under the scope of any $$\Box$$ operators in $$\varphi$$, $$n^\varphi _\Box$$ be the number of $$\Box$$-subformulae in $$\varphi$$, and $$n^\varphi _\Diamond$$ be the number of $$\Diamond$$-subformulae below $$\Box$$-operators in $$\varphi$$.
Theorem 11
A systematic tableau construction of a $${\textsf {K4} }$$-tableau for a modal formula $$\varphi$$ in simplified NNF under the following Constraints (TC1) and (TC2)
(TC1)
a rule (r) is only applicable to a prefixed formula $$\sigma : \psi$$ in a branch $$\mathscr {B}$$ if the formula is not already reduced for (r) in $$\mathscr {B}$$;

(TC2)
rule ($$\pi$$) is only applicable to prefixed formulae $$\sigma :\Diamond \psi$$ with $$|\sigma |< 2 + d^\varphi _\Diamond + n^\varphi _\Diamond \times n^\varphi _\Box$$

terminates in one of following states:
(1)
all branches of the constructed tableau are closed and $$\varphi$$ is $${\textsf {K4} }$$-unsatisfiable or

(2)
at least one branch $$\mathscr {B}$$ is not closed, no rule is still applicable to a labeled formula in $$\mathscr {B}$$, and $$\varphi$$ is $${\textsf {K4} }$$-satisfiable.

Proof
Follows from Theorems 8.1 and 8.4 in [18]. Theorem 8.4 does not require that the tableau construction is systematic, but then allows for a third possible termination state, namely, that in every branch some rule is still applicable. The proof states explicitly that the construction only terminates in this state if it was not systematic. We assume a systematic construction and thereby exclude that third possibility.$$\square$$
Theorem 11 allows rule ($$\pi$$) to be applied to a prefix $$\sigma$$ of length $$1 + d^\varphi _\Diamond + n^\varphi _\Diamond \times n^\varphi _\Box$$, creating a prefix of length $$2 + d^\varphi _\Diamond + n^\varphi _\Diamond \times n^\varphi _\Box$$. No prefix of greater length can occur in a tableau.
For $${\textsf {K5} }$$, Massacci did not provide a bound on the length of prefixes in his SST calculus that preserves refutational completeness. However, using the techniques that he applied to prove such a bound for $${\textsf {K4} }$$, Theorem 12 establishes a bound for $${\textsf {K5} }$$.
Theorem 12
A systematic tableau construction of a $${\textsf {K5} }$$-tableau for a modal formula $$\varphi$$ in simplified NNF under the following Constraints (TC1) and (TC2)
(TC1)
a rule (r) is only applicable to a prefixed formula $$\sigma : \psi$$ in a branch $$\mathscr {B}$$ if the formula is not already reduced for (r) in $$\mathscr {B}$$;

(TC2)
rule $$(\pi )$$ is only applicable to prefixed formulae $$\sigma :\Diamond \psi$$ with $$|\sigma |< 2 + d^\varphi _\Diamond + n^\varphi _\Diamond$$

terminates in one of following conditions:
(1)
all branches of the constructed tableau are closed and $$\varphi$$ is $${\textsf {K5} }$$-unsatisfiable or

(2)
at least one branch $$\mathscr {B}$$ is not closed, no rule is still applicable to a labeled formula in $$\mathscr {B}$$, and $$\varphi$$ is $${\textsf {K5} }$$-satisfiable.

Table 5
Inference rules of the Modal-Layered Resolution calculus
In order to establish a relationship between closed tableaux and resolution refutations of a set of $$\textsf {SNF}_{ml}$$ clauses, we formally define the modal-layered resolution calculus. Table 5 shows the inference rules of the calculus restricted to labels occurring in the clauses produced by our reductions. For GEN1 and GEN3, if the modal clauses in the premises occur at the modal level ml, then the literal clause in the premises occurs at the modal level, $$ml+1$$.
Let $$\varPhi$$ be a set of $$\textsf {SNF}_{ml}$$ clauses. A (resolution) derivation from $$\varPhi$$ is a sequence of sets $$\varPhi _0,\varPhi _1,\ldots$$ where $$\varPhi _0 = \varPhi$$ and, for each $$i>0$$, $$\varPhi _{i+1} = \varPhi _i \cup \{D\}$$, where $$D \not \in \varPhi _i$$ is the resolvent obtained from $$\varPhi _i$$ by an application of one the inference rules to premises in $$\varPhi _i$$. A (resolution) refutation of $$\varPhi$$ is a derivation $$\varPhi _0,\ldots ,\varPhi _k$$, $$k \in {\mathbb N}$$, where $$0:\mathbf{false}\in \varPhi _k$$.
To map a set of $$\textsf {SNF}_{sml}$$ clauses to a set of $$\textsf {SNF}_{ml}$$ clauses, using a bound $$n\in {\mathbb N}$$ on the modal levels, we define a function $$\mathrm {db}_{n}$$ on clauses and sets of clauses in $$\textsf {SNF}_{sml}$$ as follows:
\begin{aligned} \mathrm {db}_{n}(S:\varphi )&= \{ml:\varphi \mid ml\in S\text { and }ml \le n\}\\ \mathrm {db}_{n}(\varPhi )&= \textstyle \bigcup _{S:\varphi \in \varPhi } \mathrm {db}_{n}(S:\varphi ) \end{aligned}
Note that prefixes in SST-tableaux have a minimal length of 1 while the minimal modal level in $$\textsf {SNF}_{ml}$$ clauses is 0. So, a prefix of length n in a prefixed formula corresponds to a modal level $$n-1$$ in an $$\textsf {SNF}_{ml}$$ clause.
Theorem 13
Let $$\varphi$$ be a K4-unsatisfiable formula in simplified NNF. Let $$hb_{\textsf {K4}}^\varphi = 2 + d^\varphi _\Diamond + n^\varphi _\Diamond \times n^\varphi _\Box$$. Let $$\varPhi _{{\textsf {\textit{4}}}} = \mathrm {db}_{hb_{\textsf {K4}}^\varphi -1}(\{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K4}}}}(\{0\}:t_\varphi \rightarrow \varphi ))$$. Then there is a resolution refutation of $${\varPhi _{{\textsf {\textit{4}}}}}$$.
Proof
(Sketch) We inductively construct a closed $${\textsf {K4} }$$-tableau $$\mathscr {T}$$ for $$\varphi$$ as follows:
1.
The root node of $$\mathscr {T}$$ is labeled with the prefixed formulae $$1:\varphi$$.

2.
While the tableau is not closed do: Let $$\mathscr {B}$$ be the left-most branch of $$\mathscr {T}$$ that is not closed yet, and let $$\sigma$$ be the longest prefix of any prefixed formula in $$\mathscr {B}$$.
(a)
If rule (r), $$r\in \{\alpha ,\beta \}$$, can be applied to a formula $$\sigma :\psi$$ in $$\mathscr {B}$$ such that $$\sigma :\psi$$ is not already reduced in $$\mathscr {B}$$, then extend $$\mathscr {B}$$ by applying (r) to $$\sigma :\psi$$;

(b)
If every formula $$\sigma :\psi$$ to which a rule (r), $$r\in \{\alpha ,\beta \}$$, could be applied is already reduced in $$\mathscr {B}$$, then $${\mathscr {B}|^\mathsf{p}_{\sigma }}$$ must be a consistent set of propositional literals (otherwise $$\mathscr {B}$$ would be closed), $${\mathscr {B}|^\mathsf{m}_{\sigma }}$$ has the form with $$m > 0$$ and $$n\ge 0$$, and there exists at least one j, $$1\le j\le m$$, such that $$\{\Diamond \varphi _{j},\Box \psi _1,\ldots ,\Box \psi _{n}\}$$ is $${\textsf {K4} }$$-unsatisfiable. We pick exactly one such j. First, extend $$\mathscr {B}$$ by applying rule ($$\pi$$) to $$\sigma :\Diamond \varphi _{j}$$, adding a node labeled with $$\sigma ':\varphi _{j}$$, where $$\sigma ' = \sigma .n_j$$ for some $$\sigma .n_j$$ that is new in $$\mathscr {B}$$. Second, extend $$\mathscr {B}$$ by applying rule (K) to $$\sigma :\Box \psi _1$$, ..., $$\sigma :\Box \psi _{n}$$, respectively, adding nodes labeled with $$\sigma ':\psi _l$$, $$1\le l\le n$$. Third, extend $$\mathscr {B}$$ by applying rule (4) to $$\sigma :\Box \psi _1$$, ..., $$\sigma :\Box \psi _{n}$$, respectively, adding nodes labeled with $$\sigma ':\Box \psi _l$$, $$1\le l\le n$$.

We can prove that it is indeed possible to construct a closed $${\textsf {K4} }$$-tableau in the manner described above. Then, according to Theorem 11, the construction will terminate with a closed tableau that only contains prefixes $$\sigma$$ with $$|\sigma |\le hb_{{\textsf {K4} }}^\varphi$$.
• Case (a): Assume there are no applications of rule ($$\pi$$) in the construction of $$\mathscr {T}$$. As only an application of rule $$(\pi )$$ would introduce a new prefix in a tableau derivation, the only prefix occurring in the tableaux is 1 with $$|1| = 1 \le 2 \le hb^\varphi _{{\textsf {K4} }}$$. As rule ($$\pi$$) was not used, only rules ($$\alpha$$) and ($$\beta$$) have been used. We can prove that the propositional formula $$\bar{\varphi }$$ obtained from $$\varphi$$ by replacing all subformulae of $$\varphi$$ of the form $$\Box \psi$$ by $$t_{\Box \psi }$$ and all subformulae of the form $$\Diamond \psi$$ by $$t_{\Diamond \psi }$$ is unsatisfiable. Then $$\bar{\varPhi }_{{\textsf {\textit{4}}}} = \mathrm {db}_{hb^{\bar{\varphi }}_{{\textsf {K4} }}-1}(\{\{0\}:t_{\bar{\varphi }}\}\cup \rho _{{\textsf {\textit{K4}}}}(\{0\}:t_{\bar{\varphi }}\rightarrow \bar{\varphi })) \subseteq \varPhi _{{\textsf {\textit{4}}}}$$ and $${\bar{\varPhi }_{{\textsf {\textit{4}}}}}$$ only contains literal clauses with label 0 independent of the bound $$hb^{\bar{\varphi }}_{{\textsf {K4} }}$$. As $$\bar{\varphi }$$ is unsatisfiable so must be $${\bar{\varPhi }_{{\textsf {\textit{4}}}}}$$ and there must be a resolution refutation of $${\bar{\varPhi }_{{\textsf {\textit{4}}}}}$$ using only the inference rule LRES due to the refutational completeness of LRES, for sets of literal clauses.
• Case (b): Let N be the set of all nodes on $$\mathscr {T}$$ labeled with rule ($$\pi$$), i.e., each of those nodes was added by an application of rule ($$\pi$$). Let $$\mathfrak {B}$$ be the set of all partial branches such that for every node n in N, $$\mathfrak {B}$$ contains a partial branch $$(n_0,\ldots ,n_k)$$, $$0\le k$$, where $$n_0$$ is the root node of $$\mathscr {T}$$ and n is the successor node of $$n_k$$ in $$\mathscr {B}$$. Each partial branch in $$\mathfrak {B}$$ represents a ‘state’ that a branch of $$\mathscr {T}$$ was in just before rule ($$\pi$$) was applied in our construction. We define a well-founded partial order $$\prec$$ on $$\mathfrak {B}$$ as $$\mathscr {B}\prec \mathscr {B}'$$ iff $$\mathscr {B}$$ is an extension of $$\mathscr {B}'$$. We first show that for every $$\mathscr {B}\in \mathfrak {B}$$, we can derive a literal clause $$ml: C_{\mathscr {B}}$$ from $${\varPhi _{{\textsf {\textit{4}}}}}$$ that subsumes $$ml:\lnot t_{\Diamond \varphi _{\mathscr {B}}}\vee \bigvee (\{\lnot t_{\Box \psi }\;|\;\Box \!\psi \in {\mathscr {B}|^\mathsf{m}_{\sigma _{\mathscr {B}}}}\})$$ where $$ml = |\sigma _{\mathscr {B}}|-1$$. The proof proceeds by induction on $$\langle \mathfrak {B},\prec \rangle$$ and the derivation of the literal clause $$ml: C_{\mathscr {B}}$$ involves the rules GEN1, GEN2 and GEN3. Then consider the closed tableau $$\mathscr {T}$$ with root node $$n_\varphi$$. Let $$\mathscr {T}'$$ be the subtree of $$\mathscr {T}$$ with root node $$n_\varphi$$ and containing only those nodes and branches formed by applications of rules ($$\alpha$$) and ($$\beta$$) to $$n_\varphi$$ and its descendants. Each branch $$\mathscr {B}$$ of $$\mathscr {T}'$$ such that the propositional formula $$\bigwedge {\mathscr {B}|^\mathsf{p}_{1}}$$ is satisfiable must be an element of $$\mathfrak {B}$$ with associated literal clause $$0: C_{\mathscr {B}}$$. Let $$\mathcal {C}$$ be the set of all those clauses. With $$\bar{\varphi }$$ and $${\bar{\varPhi }_{{\textsf {\textit{4}}}}}$$ defined as in Case (a), we can then show that $${\bar{\varPhi }_{{\textsf {\textit{4}}}}\cup \mathcal {C}}$$ is unsatisfiable. As $${\bar{\varPhi }_{{\textsf {\textit{4}}}}\subseteq \varPhi _{{\textsf {\textit{4}}}}}$$ and all clauses in $$\mathcal {C}$$ are derivable from $${\varPhi _{{\textsf {\textit{4}}}}}$$, $${\varPhi _{{\textsf {\textit{4}}}}}$$ is unsatisfiable and there must exist a resolution refutation of it.$$\square$$
In analogy, we can also prove a corresponding result for $${\textsf {K5} }$$ with the bound established in Theorem 12.
Theorem 14
Let $$\varphi$$ be a $${\textsf {K5} }$$ unsatisfiable formula in simplified NNF. Let $$hb_{\textsf {K5}}^\varphi = 2 + d^\varphi _\Diamond + n^\varphi _\Diamond$$. Let $$\varPhi _{{\textsf {\textit{5}}}} = \mathrm {db}_{hb_{\textsf {K5}}^\varphi -1}(\{\{0\}:t_\varphi \}\cup \rho _{{\textsf {\textit{K5}}}}(\{0\}:t_\varphi \rightarrow \varphi ))$$. Then there is a resolution refutation of $${\varPhi _{{\textsf {\textit{5}}}}}$$.
Example 2
Reconsider the $${\textsf {K4} }$$-unsatisfiable formula $$\varphi =\Diamond q \wedge \Diamond \!\!\Diamond \!(\Box (p \wedge \Diamond \!\Diamond \!\lnot p)\wedge \Diamond q)$$ from Example 1. We have $$d^\varphi _\Diamond = 3$$, $$n^\varphi _\Diamond = 2$$, and $$n^\varphi _\Box =1$$. So, $$hb_{{\textsf {K4} }}^\varphi = 2 + d^\varphi _\Diamond + n^\varphi _\Diamond \times n^\varphi _\Box = 2 + 3 + 2\times 1 = 7$$. By Theorem 11 a systematic tableau construction of a $${\textsf {K4} }$$-tableau for $$\varphi$$ where rule ($$\pi$$) is only applicable to prefixed formulae $$\sigma :\Diamond \psi$$ with $$|\sigma |<hb_{{\textsf {K4} }}^\varphi$$ should terminate with a closed tableau. Below is such a tableau.
Note that the bound is not reached in this particular tableau. The bound is a worst case, and tableaux requiring such a bound exist for the input formula $$\varphi$$.
From the resulting clauses of $$\varPhi _\varphi = \{\{0\}:t_\varphi \}\cup \rho _{{\textsf {K4} }}(\{0\}:t_\varphi \rightarrow \varphi )$$ in Example 1 and $$\mathrm {db}_{hb^{\varphi }_{{\textsf {K4} }}-1} = \mathrm {db}_{6}(\varPhi _\varphi )$$, the set of clauses in $$\textsf {SNF}_{ml}$$ of $$\varphi$$ is as follows, where $$\psi$$ subformulae are defined as in Example 1.
A refutation for this set of clauses is the following.
Note that the refutation uses $$t_{\Box \psi _4}\rightarrow \Box t_{\psi _4}$$ twice, in the form of clauses (61) and (63), corresponding to the two applications of (4) in the tableau. Note also that the maximal level of a clause involved in the refutation is 5 (Clause (76)) and therefore equal to the length of the longest prefix occurring in the tableau, 1.2.1.1.1.1, minus one.
The approaches most closely related to ours are Kracht’s reductions of normal modal logics to basic modal logic [16, 17], the global modal resolution calculus [20], and Schmidt and Hustadt’s axiomatic translation principle for translations of normal modal logics to first-order logic [31].
The first significant difference to our approach is that Kracht’s reductions and the axiomatic translation exclude the modal operator $$\Diamond$$ from the language and only consider the modal operator $$\Box$$. In order to present Kracht’s approach, we need some additional notions. Let $$\mathsf {sf}(\varphi ), \mathsf {dg}(\varphi )$$, and |S| denote the set of all subformulae of $$\varphi$$, the maximum nesting of modal operators in $$\varphi$$, and the cardinality of the set S, respectively. Let $$\Diamond ^0\psi =\Box ^0\psi =\Box ^{<1}\psi = \psi$$, $$\Box ^{<n+1}\psi = (\psi \wedge \Box \!\Box ^{<n}\!\psi )$$, $$\Box ^{n+1}\psi =\Box \!\Box ^n\!\psi$$, and $$\Diamond ^{n+1}\psi =\Diamond \!\!\Diamond ^n\!\psi$$. We can then define a reduction function $$\rho ^\textsf {K} _L$$ for a normal modal logic L in $$\{{\textsf {KB} },{\textsf {KD} },{\textsf {KT} },{\textsf {K4} }\}$$ as follows:
\begin{aligned} \rho ^{{\textsf {\textit{K}}}}_L(\varphi )&= {\left\{ \begin{array}{ll} \varphi \wedge \Box ^{<|\mathsf {sf}(\varphi )|+1} P^\textsf {K} _{{\textsf {\textit{K4}}}}(\varphi ), &{} \text {for }L = {\textsf {K4} }\\ \varphi \wedge \Box ^{<\mathsf {dg}(\varphi )+1} P^\textsf {K} _L(\varphi ) &{} \text {otherwise} \end{array}\right. } \end{aligned}
$${\begin{array}{llll} \mathrm{where} \,P^\textsf {K} _{{\textsf {\textit{KB}}}}(\varphi ) &{}= \{\lnot \psi \rightarrow \Box \lnot \!\Box \!\psi \mid \Box \!\psi \in \mathsf {sf}(\varphi )\} &{} P^\textsf {K} _{{\textsf {\textit{KD}}}}(\varphi ) &{}= \{\lnot \Box \mathbf{false}\}\\ \qquad \quad \,\,P^\textsf {K} _{{\textsf {\textit{K4}}}}(\varphi ) &{}= \{\Box \psi \rightarrow \Box \!\Box \!\psi \mid \Box \psi \in \mathsf {sf}(\varphi )\} &{} P^\textsf {K} _{{\textsf {\textit{KT}}}}(\varphi ) &{}= \{\Box \psi \rightarrow \psi \mid \Box \psi \in \mathsf {sf}(\varphi )\} \end{array}}$$
Kracht shows that $$\varphi$$ is L-satisfiable iff $$\rho ^\textsf {K} _L(\varphi )$$ is $$\textsf {K} {}{}$$-satisfiable. There are three differences to our approach. First, $$P^\textsf {K} _L(\varphi )$$ will include an axiom instance for every occurrence of a subformula $$\lnot \Box \psi$$, equivalent to $$\Diamond \lnot \psi$$, in $$\varphi$$. In contrast, our approach requires no logic specific treatment of such subformulae. Second, the use of $$\Box ^{<n} P^\textsf {K} _L(\varphi )$$ in $$\rho ^\textsf {K} _L$$ means that the axiom instance is available at every modal level. This means, for example, that for $$\vartheta _1 = \Diamond ^{100}(\lnot p\wedge \Box p)$$, the formula $${\rho ^\textsf {K} _{{\textsf {\textit{KT}}}}(\vartheta _1)}$$ contains the axiom instance $$\Box p\rightarrow p$$ over 100 times, although it is only required at the level at which $$\Box p$$ occurs. Third, this is further compounded if the formula $$\psi$$ in $$\Box \psi$$ is itself a complex formula. We try to avoid that by using a surrogate propositional symbol $$t_\psi$$ instead, but this will only have a positive effect if the definitional clauses for $$t_\psi$$ do not have to be repeated.
Table 6
Inference rules in [20] for $${\textsf {K5} }$$ (EUC1 and EUC2)
The global modal resolution (GMR) calculus operates on $$\mathsf {SNF}_K$$ clauses, that is, clauses of the form
\begin{aligned} \textstyle \Box ^*(\mathbf{start}\rightarrow \bigvee _{b=1}^{r} l_b) \textstyle \Box ^*(\mathbf{true}\rightarrow \bigvee _{b=1}^{r} l_b) \Box ^* (l' \rightarrow \Box l) \Box ^*(l' \rightarrow \lnot \!\Box \!l) \end{aligned}
where l, $$l'$$, $$l_b$$ are propositional literals with $$1 \le b \le r$$, $$r \in {\mathbb N}$$, and $$\Box ^*$$ is the universal operator. The calculus has specific inference rules for normal modal logics such as $${\textsf {KB} }$$, $${\textsf {KD} }$$, $${\textsf {KT} }$$, $${\textsf {K4} }$$, $${\textsf {K5} }$$. Table 6 shows the two additional rules for $${\textsf {K5} }$$, the only logic for which there are rules for both $$\Box$$ and $$\lnot \!\Box \!\lnot$$, i.e., $$\Diamond$$. These inference rules can be seen to perform an ‘on-the-fly’ computation of a reduction. Note that the clauses produced by $${P_{{\textsf {\textit{K5}}}}}$$ differ from those produced by GMR for $${\textsf {K5} }$$. Implicitly, our results here also show that it should be possible to eliminate EUC1 from the GMR calculus.
For the axiomatic translation, we only present the function $$P^\textsf {R}S _L$$ that computes the logic dependent first-order clausal formulae that are part of the overall translation.
\begin{aligned} P^\textsf {R}S _\textsf {K}B (\Box \psi )&= \{\forall x(\lnot Q_{\Box \psi }(y)\vee \lnot R(x,y)\vee Q_\psi (x))\mid \Box \psi \in \mathsf {sf}(\varphi )\}\\ P^\textsf {R}S _\textsf {K}D (\Box \psi )&= \{\forall x(\lnot Q_{\Box \psi }(x)\vee Q_{\lnot \Box \lnot \psi }(x))\mid \Box \psi \in \mathsf {sf}(\varphi )\}\\ P^\textsf {R}S _\textsf {K}T (\Box \psi )&= \{\forall x(\lnot Q_{\Box \psi }(x)\vee Q_\psi (x))\mid \Box \psi \in \mathsf {sf}(\varphi )\}\\ P^\textsf {R}S _\textsf {K}4 (\Box \psi )&= \{\forall x y(\lnot Q_{\Box \psi }(x)\vee \lnot R(x,y)\vee Q_{\Box \psi }(y))\mid \Box \psi \in \mathsf {sf}(\varphi )\}\\ P^\textsf {R}S _\textsf {K}5 (\Box \psi )&= \{\begin{array}{@{}l@{}} \forall x y (\lnot Q_{\Box \psi }(y)\vee \lnot R(x,y)\vee Q_{\Box \psi }(x)),\\ \forall x y (\lnot Q_{\Box \lnot \Box \psi }(y)\vee \lnot R(x,y)\vee Q_{\Box \lnot \Box \psi }(x)) \mid \Box \psi \in \mathsf {sf}(\varphi )\} \end{array} \end{aligned}
Here the variables x and y range over worlds. The predicate symbols $$Q_\psi$$ correspond to our surrogate symbols $$t_\psi$$. The clausal formulae used in the treatment of $${\textsf {KT} }$$ and $${\textsf {K4} }$$ are translations of the $$\textsf {SNF}_{ml}$$ clauses we use (or vice versa). $${\textsf {KB} }$$ and $${\textsf {K5} }$$ are handled in a different way as the first-order clausal formulae refer directly the accessibility relation and can therefore more easily express the transfer of information to a predecessor world. The universal quantification over worlds also means that the constraints expressed by the formulae hold at all modal levels without the need of any repetition.
In Sect. 8, we will also use the relational and semi-functional translation of modal logics to first-order logic combined with structural transformation to clause normal form. In both approaches $$\Box \psi$$ is translated as $$\forall x y (\lnot Q_{\Box \psi }(x)\vee \lnot R(x,y)\vee Q_\psi (y))$$, while $$\Diamond \psi$$ becomes $$\forall x\exists y (\lnot Q_{\Diamond \psi }(x)\vee (R(x,y) \wedge Q_\psi (y)))$$ and $$\forall x\exists \alpha (\lnot Q_{\Diamond \psi }(x)\vee (\mathrm {def}(x)\wedge Q_\psi ([x\alpha ])))$$ in the relational and semi-functional translation, respectively. Here, the variables x and y also range over worlds while $$\alpha$$ and $$\beta$$ range over partial accessibility functions.
Then, depending on the modal logics, further formulae representing the semantic properties of the accessibility R are added. For the relational translation these will simply be the formulae in the fourth column of Table 1. The semi-functional translation uses collections of partial accessibility function in addition to the accessibility relation. A predicate $$\mathrm {def}$$ is used to represent on which worlds a partial accessibility function is defined. For each modal logic there is then again a background theory consisting of formulae over $$\mathrm {def}$$ and R that represents the properties of the underlying accessibility relation which is added to the translation of a formula. For example, for $${\textsf {K5} }$$ the background theory is: $$\forall x y\forall \alpha \beta ((\lnot \mathrm {def}(x)\vee \mathrm {def}(y))\wedge (\lnot \mathrm {def}(\mathrm {w_0})\vee R(\mathrm {w_0},[\mathrm {w_0}\alpha ]))\wedge (\lnot \mathrm {def}(x)\vee \lnot \mathrm {def}(y)\vee R([x\alpha ],[y\beta ]))),$$ where $$\mathrm {w_0}$$ is a constant representing the root world in a rooted Kripke structure.
In [35], Sebastiani and Venscovi present an encoding of $${\textsf {K} }$$ into propositional logic. In this encoding, each propositional symbol produced by their reduction corresponds to labeled formulae in each possible world following closely the application of the tableau rules for $${\textsf {K} }$$ given in [18]. As noted by the authors, such encoding leads to an exponential blow-up in the size of a formula in the worst case (if P $$\ne$$ NP). In practice, however, their implemented tool $$K_m2SAT$$, combined with state of the art SAT solvers, performed well in most of the usual benchmarks. The InkreSAT prover [15] provides decision procedures for $${\textsf {K} }$$, $${\textsf {KT} }$$, $${\textsf {K4} }$$ and $${\textsf {S4} }$$, that is, a subset of the logics considered here. Their approach also reduces the satisfiability problem for a particular logic into the satisfiability problem for propositional logic. Differently from [35], the translation is interleaved with calls to the underlying SAT prover; the result from the SAT prover is then incrementally used to guide the translation. This helps with earlier simplification and better performance when compared with $$K_m2SAT$$. In the worst case, however, as with [35], the translation is exponential in the size of the input formula. In [24], we have compared InKreSAT and $${\text {K}_{\text {S}}}{\text {P}}$$, $$K_m2SAT$$ does not appear to be publicly available anymore. The evaluation indicates InKreSAT has the second best performance when all the benchmarks were considered, but less impressive results on the LWB benchmark with the fifth best performance among the six competing tools.

## 8 Evaluation

For our evaluation, we have restricted ourselves to fully automatic provers with built-in support for all the six logics we have considered. By ‘built-in support,’ we mean the possibility to specify the logic either via command-line option or via a configuration option within an input file together with modal formula.
We have compared the performance of the following approaches: (i) the combination of our reductions with the modal-layered resolution (MLR) calculus for $$\textsf {SNF}_{ml}$$ clauses [21], R+MLR calculus for short, implemented in the modal theorem prover $${\text {K}_{\text {S}}}{\text {P}}$$, with three different refinements for resolution inferences on labeled propositional clauses; (ii) the global modal resolution (GMR) calculus, also implemented in $${\text {K}_{\text {S}}}{\text {P}}$$, with three different refinements for resolution inferences on propositional clauses; (iii) the combinations of the relational and semi-functional translation of modal logics to first-order logic with ordered first-order resolution implemented in the first-order theorem prover SPASS; (iv) the higher-order logic prover LEO-III with $${\textbf {E}}$$ 2.6 as external reasoner.
In total this gives us nine different approaches to compare. The axiomatic translation is currently not implemented in SPASS. Other provers, such as LWB [13] and MleanCoP [27], do not have built-in support for the full range of logics considered here. LoTREC 2.0 [8] supports all the logics, but is not intended as automatic theorem prover.
$${\text {K}_{\text {S}}}{\text {P}}$$ [19] implements the reductions presented in Sect. 3, the transformation from $$\textsf {SNF}_{sml}$$ to $$\textsf {SNF}_{ml}$$ presented in Sect. 6, as well as a normal form transformation of modal formulae to sets of $$\mathsf {SNF}_K$$ clauses, required for the GMR calculus. It implements both the R+MLR and the GMR calculus. Resolution inferences between (labeled) propositional clauses can either be unrestricted (cplain option), restricted by an ordering (cord option), that is, clauses can only be resolved on their maximal literals with respect to an ordering chosen by the prover in such a way to preserve completeness, restricted to negative resolution (cneg option), that is, one of the premises in an inference has to be a negative clause, or restricted to positive resolution. We do not include the last option in our evaluation as it typically performs worse. $${\text {K}_{\text {S}}}{\text {P}}$$ also implements a range of simplification rules that are applied to modal formulae before their transformation to normal form. Of those, we have enabled pure literal elimination (early_ple option), simplification using the Box Normal Form [28] and Prenex Normal Form (bnfsimp and prenex options) [22]. For clause processing, unit resolution and pure elimination are enabled (unit, lhs_unit, and ple options).
SPASS 3.9 [38, 39] supports automated reasoning in extended modal logics, including all logics considered here, PDL-like modal logics as well as description logics. It includes eight different translations of modal logics to first-order logic. In our evaluation, we have used the relational translation and the semi-functional translation. For the local satisfiability problem in $${\textsf {KB} }$$ to $${\textsf {K5} }$$, for the relational translation, SPASS adds the first-order frame properties given in Table 1 while for the semi-functional translation, it adds the background theories devised by Nonnengart [26]. For the transformation to first-order clausal form, we have enabled renaming of quantified subformulae. The only inference rules used are ordered resolution and ordered factoring, the reduction rules used are condensing, backward subsumption, and forward subsumption. For the relational and semi-functional translation for $${\textsf {K} }$$, $${\textsf {KB} }$$, $${\textsf {KD} }$$, and $${\textsf {KT} }$$ we thereby obtain a decision procedure, while for the other logics we do not. For $${\textsf {K4} }$$ and $${\textsf {K5} }$$, the fragment of first-order clausal logic corresponding to the semi-functional translation of modal formula and their background theories is decidable by ordered resolution with selection [32]. However, the non-trivial ordering and selection function required is not currently implemented in SPASS.
LEO-III [9, 36] makes use of a semantic embedding approach [10] to automatically transform modal formulae into corresponding HOL formulae. This embedding is most closely related to the relational translation in that it employs a representation of the worlds and accessibility relationship in Kripke frames and deals with modal logics other than the basic modal logic $${\textsf {K} }$$ by adding the corresponding frame properties. LEO-III implements extensional paramodulation for higher-order logic [37] but can also collaborate with external reasoners during proof search. In our evaluation, we have exclusively used $${\textbf {E}}$$ 2.6 [33, 34] as external reasoner.
Table 7
Experimental results on LWB benchmark collection
L
S
Total
$${\text {K}_{\text {S}}}{\text {P}}$$ (GMR, cneg)
$${\text {K}_{\text {S}}}{\text {P}}$$ (GMR, cord)
$${\text {K}_{\text {S}}}{\text {P}}$$ (GMR, cplain)
LEO-III

$${\textsf {K} }$$
S
180
112
139
93
0

$${\textsf {K} }$$
U
180
154
156
152
58

$${\textsf {KD} }$$
S
180
125
145
119
0

$${\textsf {KD} }$$
U
180
154
156
152
54

$${\textsf {KT} }$$
S
100
53
69
38
0

$${\textsf {KT} }$$
U
260
234
238
225
166

$${\textsf {KB} }$$
S
122
53
81
42
0

$${\textsf {KB} }$$
U
238
197
208
198
121

$${\textsf {K4} }$$
S
161
40
60
38
0

$${\textsf {K4} }$$
U
199
146
144
148
75

$${\textsf {K5} }$$
S
60
17
15
10
0

$${\textsf {K5} }$$
U
300
256
256
261
243

All
S
803
400
509
340
0

All
U
1357
1141
1158
1136
717

L
S
Total
$${\text {K}_{\text {S}}}{\text {P}}$$ (GMR, cneg)
$${\text {K}_{\text {S}}}{\text {P}}$$ (GMR, cord)
$${\text {K}_{\text {S}}}{\text {P}}$$ (GMR, cplain)
LEO-III

$${\textsf {K} }$$
S
180
142
158
138
92
97
$${\textsf {K} }$$
U
180
159
158
156
134
122
$${\textsf {KD} }$$
S
180
141
156
133
107
103
$${\textsf {KD} }$$
U
180
155
156
155
136
130
$${\textsf {KT} }$$
S
100
47
56
27
47
39
$${\textsf {KT} }$$
U
260
231
238
222
222
199
$${\textsf {KB} }$$
S
122
26
75
16
31
23
$${\textsf {KB} }$$
U
238
207
214
201
159
169
$${\textsf {K4} }$$
S
161
39
53
17
0
0
$${\textsf {K4} }$$
U
199
155
132
153
109
35
$${\textsf {K5} }$$
S
60
8
10
4
7
0
$${\textsf {K5} }$$
U
300
255
247
247
255
124
All
S
803
403
508
335
284
262
All
U
1357
1162
1145
1134
1015
779
For our evaluation, we have chosen the LWB basic modal logic benchmark collection [2], with 20 formulae in each of 18 parameterized classes. For $${\textsf {K} }$$, all formulae in 9 classes are satisfiable while all formulae in the other 9 classes are unsatisfiable. In simplified NNF, 63% of modal operators are $$\Box$$ and 37% are $$\Diamond$$ operators. We have used the collection for each of the six logics. If a formula is unsatisfiable in $${\textsf {K} }$$ then it remains unsatisfiable in the other five logics, while the opposite is not true. As we move to logics other than $${\textsf {K} }$$, it is also no longer the case that all formulae in a class have the same satisfiability status.
Table 7 shows the results of our evaluation. The first column lists the six logics. We then separate the 360 LWB benchmark formulae into satisfiable (S) and unsatisfiable (U) formulae with respect to each logic. This gives us 12 categories. The third column then indicates the number of formulae in each. The last nine columns in the table show how many formulae within a category each of the approaches was able to solve with a time limit of 100 CPU seconds for each formula. In the last two lines of the table, we sum up the results for all logics. Benchmarking was performed on a PC with an AMD Ryzen 5 5600X CPU @ 4.60GHz max and 32GB main memory using Fedora release 34 as operating system. As we can see, the two best performing approaches are the GMR calculus with the ordered resolution refinement (cord) and the R+MLR calculus with the ordered resolution refinement, with the former performing slightly better. Each approach achieves the highest number of solved formulae in 3 categories and they are joint best on a further two categories. The GMR calculus is better on satisfiable formulae in almost all logics as it avoids the duplication of clauses introduced by the transformation from $$\textsf {SNF}_{sml}$$ to $$\textsf {SNF}_{ml}$$ required for the R+MLR calculus. On the other hand, the R+MLR calculus is better on most categories of unsatisfiable formulae. For SPASS, overall, we see a clear advantage of the semi-functional translation over the relational one, on both satisfiable and unsatisfiable formulae. LEO-III performs reasonably well on unsatisfiable formulae but cannot solve any of the satisfiable formulae. It is interesting to see that it performs better than SPASS with the relational translation on unsatisfiable $${\textsf {K4} }$$ and $${\textsf {K5} }$$ formulae. We put this down to the use of $${\textbf {E}}$$ as external prover. Out of 717 formulae solved by LEO-III, $${\textbf {E}}$$ provides the proof for 573 of those, including 267 out of 318 unsatisfiable $${\textsf {K4} }$$ and $${\textsf {K5} }$$ formulae solved. This shows that $${\textbf {E}}$$ solves considerably more of those formulae than SPASS with 159 formulae.
It is worth pointing out that the results for $${\text {K}_{\text {S}}}{\text {P}}$$ in Table 7 differ from those in [29]. First, improvements have been made to the implementation of the GMR calculus meaning it solves more formulae now. Second, in [29], we have used bounds for the reduction from $$\textsf {SNF}_{sml}$$ to $$\textsf {SNF}_{ml}$$ for $${\textsf {K4} }$$ and $${\textsf {K5} }$$ that were sufficient for the LWB benchmark formulae, but lower than the worst case bounds we established in Sect. 6. Here, we use the latter which results in fewer formulae being solved by the R+MLR calculus.

## 9 Conclusion and Future Work

We have presented new reductions of propositional modal logics $${\textsf {KB} }$$, $${\textsf {KD} }$$, $${\textsf {KT} }$$, $${\textsf {K4} }$$, $${\textsf {K5} }$$ to Separated Normal Form with Sets of Modal Levels. We have shown experimentally that these reductions allow us to reason effectively in these logics.
The obvious next step is to consider extensions of the basic modal logic $${\textsf {K} }$$ with combinations of the axioms $$\textsf {B}$$, $$\textsf {D}$$, $$\textsf {T}$$, $$\textsf {4}$$, and $$\textsf {5}$$. Unfortunately, a simple combination of the reductions for each of the axioms is not sufficient to obtain a satisfiability-preserving reduction for the such modal logics. An example is the simple formula $$\lnot p\wedge \Diamond \!\Diamond \!\Box p$$ which is $${\textsf {KB4} }$$-unsatisfiable. If we define
\begin{aligned} P_{{\textsf {\textit{KB4}}}}(S:t_{\Box \psi }\rightarrow \Box \psi )&= P_{{\textsf {\textit{KB}}}}(S:t_{\Box \psi }\rightarrow \Box \psi )\cup P_{{\textsf {\textit{K4}}}}(S:t_{\Box \psi }\rightarrow \Box \psi )\\ \Delta _{{\textsf {\textit{KB4}}}}(S:t_{\Box \psi }\rightarrow \Box \psi )&= \delta _{{\textsf {\textit{KB4}}}}({\star },\psi ), \end{aligned}
that is, $${P_{{\textsf {\textit{KB4}}}}}$$ is the union of $${P_{{\textsf {\textit{KB}}}}}$$ and $${P_{{\textsf {\textit{K4}}}}}$$, then the clause set obtained from $$\{\{0\}: t_0\}\cup \rho _{{\textsf {\textit{KB4}}}}(\{0\}: t_0\rightarrow \lnot p\wedge \Diamond \!\Diamond \Box p)$$ is $${\textsf {K} }$$-satisfiable. The same issue also occurs in the axiomatic translation of modal logics to first-order logic where the translation for $${\textsf {KB4} }$$ is not simply the combination of the translations for $${\textsf {KB} }$$ and $${\textsf {K4} }$$ [31, Theorem 5.6]. We are currently exploring solutions to this problem.
Regarding practical applications, it would be advantageous to have an implementation of a calculus that operates directly $$\textsf {SNF}_{sml}$$ clauses. This would greatly reduce the number of inference steps performed on satisfiable formulae and simplify proof search in general. Again, such an implementation is future work.

## Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
print
DRUCKEN
Literatur
1.
Balbiani, P., Demri, S.: Prefixed tableaux systems for modal logics with enriched languages. In: Pollack, M.E. (ed.) IJCAI 1997, pp. 190–195. Morgan Kaufmann, San Mateo (1997)
2.
Balsiger, P., Heuerding, A., Schwendimann, S.: A benchmark method for the propositional modal logics K, KT, S4. J. Autom. Reason. 24(3), 297–317 (2000). https://​doi.​org/​10.​1023/​A:​1006249507577
3.
Basin, D., Matthews, S., Vigano, L.: Labelled propositional modal logics: Theory and practice. J. Log. Comput. 7(6), 685–717 (1997)
4.
Benzmüller, C., Paulson, L.C.: Multimodal and intuitionistic logics in simple type theory. Log. J. IGPL 18(6), 881–892 (2010)
5.
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2002)
6.
Fitting, M.: Prefixed tableaus and nested sequents. Ann. Pure Appl. Log. 163(3), 291–313 (2012)
7.
Gabbay, D.M.: Decidability results in non-classical logics: part I. Ann. Math. Log. 8, 237–295 (1975)
8.
Gasquet, O., Herzig, A., Longin, D., Sahade, M.: LoTREC: Logical tableaux research engineering companion. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS, vol. 3702, pp. 318–322. Springer, Berlin (2005). https://​doi.​org/​10.​1007/​11554554_​25
9.
Gleißner, T., Steen, A.: LEO-III (2022). https://​doi.​org/​10.​5281/​zenodo.​4435994
10.
Gleißner, T., Steen, A., Benzmüller, C.: Theorem provers for every normal modal logic. In: Eiter, T., Sands, D. (eds.) LPAR 2017. EPiC Series in Computing, vol. 46, pp. 14–30. EasyChair, Maun (2017). https://​doi.​org/​10.​29007/​jsb9
11.
Goré, R.: Tableau methods for modal and temporal logics. In: D’Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 297–396. Springer, Berlin (1999). https://​doi.​org/​10.​1007/​978-94-017-1754-0_​6
12.
Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54(3), 319–379 (1992)
13.
Heuerding, A., Jäger, G., Schwendimann, S., Seyfried, M.: The logics workbench LWB: a snapshot. Euromath Bull. 2(1), 177–186 (1996)
14.
Horrocks, I., Hustadt, U., Sattler, U., Schmidt, R.A.: Computational modal logic. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, chap. 4, pp. 181–245. Elsevier, Amsterdam (2006)
15.
Kaminski, M., Tebbi, T.: InKreSAT: modal reasoning via incremental reduction to SAT. In: Bonacina, M.P. (ed.) CADE2013, pp. 436–442. Springer, Berlin (2013). https://​doi.​org/​10.​1007/​978-3-642-38574-2_​31 CrossRef
16.
Kracht, M.: Reducing modal consequence relations. J. Log. Comput. 11(6), 879–907 (2001)
17.
Kracht, M.: Notes on the space requirements for checking satisfiability in modal logics. In: Balbiani, P., Suzuki, N.Y., Wolter, F., Zakaryaschev, M. (eds.) Advances in Modal Logic 4, pp. 243–264. King’s College Publications, London (2003) MATH
18.
Massacci, F.: Single step tableaux for modal logics. J. Autom. Reason. 24, 319–364 (2000). https://​doi.​org/​10.​1023/​A:​1006155811656
19.
Nalon, C.: $${\text{K}_\text{ S }}{\text{ P }}$$ (2022). https://​nalon.​org/​#software
20.
Nalon, C., Dixon, C.: Clausal resolution for normal modal logics. J. Algorithms 62, 117–134 (2007)
21.
Nalon, C., Dixon, C., Hustadt, U.: Modal resolution: proofs, layers, and refinements. ACM Trans. Comput. Log. 20(4), 23:1–23:38 (2019)
22.
Nalon, C., Hustadt, U., Dixon, C.: $${\text{ K}_\text{ S }}{\text{ P }}$$: a resolution-based prover for multimodal K. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS, vol. 9706, pp. 406–415. Springer, Heidelberg (2016). https://​doi.​org/​10.​1007/​978-3-319-40229-1_​28
23.
Nalon, C., Hustadt, U., Dixon, C.: A modal-layered resolution calculus for K. In: de Nivelle, H. (ed.) TABLEAUX 2015. LNCS, vol. 9323, pp. 185–200. Springer, Berlin (2015). https://​doi.​org/​10.​1007/​978-3-319-24312-2_​13
24.
Nalon, C., Hustadt, U., Dixon, C.: $${\text{ K}_\text{ S }}{\text{ P }}$$: architecture, refinements, strategies and experiments. J. Autom. Reason. 64(3), 461–484 (2020). https://​doi.​org/​10.​1007/​s10817-018-09503-x
25.
Nguyen, L.A., Szalas, A.: Exptime tableau decision procedures for regular grammar logics with converse. Studia Logica 98(3), 387–428 (2011)
26.
Ohlbach, H.J., Nonnengart, A., de Rijke, M., Gabbay, D.M.: Encoding two-valued nonclassical logics in classical logic. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, chap. 21, pp. 1403–1485. Elsevier, Amsterdam (2001)
27.
Otten, J.: MleanCoP: a connection prover for first-order modal logic. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) JCAR2014. LNCS, vol. 8562, pp. 269–276. Springer, Berlin (2014). https://​doi.​org/​10.​1007/​978-3-319-08587-6_​20 CrossRef
28.
Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for the modal logic K. J. Appl. Non-Class. Log. 16(1–2), 169–208 (2006)
29.
Papacchini, F., Nalon, C., Hustadt, U., Dixon, C.: Efficient local reductions to basic modal logic. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS, vol. 12699, pp. 76–92. Springer, Berlin (2021). https://​doi.​org/​10.​1007/​978-3-030-79876-5_​5 CrossRef
30.
Schmidt, R.A.: Decidability by resolution for propositional modal logics. J. Autom. Reason. 22(4), 379–396 (1999). https://​doi.​org/​10.​1023/​A:​1006043519663
31.
Schmidt, R.A., Hustadt, U.: The axiomatic translation principle for modal logic. ACM Trans. Comput. Log. 8(4), 19 (2007)
32.
Schmidt, R.A., Hustadt, U.: First-order resolution methods for modal logics. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics: Essays in Memory of Harald Ganzinger. LNCS, vol. 7797, pp. 345–391. Springer, Berlin (2013). https://​doi.​org/​10.​1007/​978-3-642-37651-1_​15
33.
34.
Schulz, S., Cruanes, S., Vukmirović, P.: Faster, higher, stronger: E 2.3. In: Fontaine, P. (ed.) CADE 2019. LNAI, vol. 11716, pp. 495–507. Springer, Berlin (2019). https://​doi.​org/​10.​1007/​978-3-030-29436-6_​29
35.
Sebastiani, R., Vescovi, M.: Automated reasoning in modal and description logics via SAT encoding: the case study of K(m)/ALC-satisfiability. J. Artif. Intell. Res. 35, 343–389 (2009)
36.
Steen, A., Benzmüller, C.: The higher-order prover Leo-III. In: Giacomo, G.D., Catalá, A., Dilkina, B., Milano, M., Barro, S., Bugarín, A., Lang, J. (eds.) ECAI2020. Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 2937–2938. IOS Press, Amsterdam (2020). https://​doi.​org/​10.​3233/​FAIA200462
37.
Steen, A., Benzmüller, C.: Extensional higher-order paramodulation in LEO-III. J. Autom. Reason. 65(6), 775–807 (2021). https://​doi.​org/​10.​1007/​s10817-021-09588-x
38.
The SPASS Team: SPASS 3.9 (2016). http://​www.​spass-prover.​org/​
39.
Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1965–2013. Elsevier and MIT Press, Cambridge (2001) CrossRef
Titel
Local is Best: Efficient Reductions to Modal Logic K
verfasst von
Fabio Papacchini
Cláudia Nalon
Clare Dixon
Publikationsdatum
23.05.2022
Verlag
Springer Netherlands
Erschienen in
Journal of Automated Reasoning / Ausgabe 4/2022
Print ISSN: 0168-7433
Elektronische ISSN: 1573-0670
DOI
https://doi.org/10.1007/s10817-022-09630-6

Zur Ausgabe