1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);F Baader,2005
2. Cantone, D., Ferro, A., Omodeo, E.G.: Computable set theory. Number 6 in International Series of Monographs on Computer Science. Oxford Science Publications, Clarendon Press, Oxford, UK (1989)
3. Cantone, D., Longo, C.: A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions. Theor. Comput. Sci. 560, 307–325 (2014)
4. Cantone, D., Longo, C., Nicolosi Asmundo, M.: A decidable quantified fragment of set theory involving ordered pairs with applications to description logics. In: Proceedings Computer Science Logic, 20th Annual Conference of the EACSL, CSL 2011, pp. 129–143, Bergen, Norway, 12–15 September 2011
5. Cantone, D., Longo, C., Nicolosi Asmundo, M.: A decision procedure for a two-sorted extension of multi-level syllogistic with the Cartesian product and some map constructs. In: Faber, W., Leone, N. (eds.) Proceedings of the 25th Italian Conference on Computational Logic (CILC 2010), Rende, Italy, 7–9 July 2010, vol. 598, pp. 1–18 (paper 11). CEUR Workshop Proceedings, ISSN 1613–0073, June 2010