1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
2. Arnold, A., Niwiński, D.: Fixed point characterization of weak monadic logic definable sets of trees. In: A. M.Nivat (ed.) Tree Automata and Languages, pp. 159–188. Elsevier Science Publishers B.V. (1992)
3. Ashenhurst, R.: The decomposition of switching functions, vol. 29, pp. 74–116. Annals Computation Laboratory, Harvard University (1959)
4. Bagirov, A., Ordin, B., Ozturk, G., Xavier, A.: An incremental clustering algorithm based on hyperbolic smoothing. Comp. Opt. Appl. 61(1), 219–241 (2015). http://dx.doi.org/10.1007/s10589-014-9711-7
5. Belardinelli, F., Lomuscio, A.: Quantified epistemic logics for reasoning about knowledge in multi-agent systems. Artif. Intell. 173(9), 982–1013 (2009)