 In this way one gets not only a conceptual but also formal link to the information-as-range approach, because constraint models can be used to interpret a basic modal language with atomic formulas of the form \(P\)—where \(P\) is one of the labels of predicates in Pred—and with complex formulas of the form \(\neg \phi, \phi \vee \psi, U\phi\), and \(\Box_{\mathbf{x}}\phi\), where \(\mathbf{x}\) is a partial tuple of components and \(U\) is the universal modality.  More concretely, given a constraint model \(\mathscr{M}\) and a global state \(s\), the crucial satisfaction conditions are given by: 