Omodeo: writings

Selected Writings by Eugenio Omodeo

Most of the recent publications, including the Springer monographs M1 and M2, are not recorded here below, but HERE.

A. Formisano, E.G. Omodeo, and M. Temperini. Goals and benchmarks for automated map reasoning, Journal of Symbolic Computation, 29(2):259-297, February 2000.
A. Formisano and E.G. Omodeo. An equational re-engineering of set theories, in G. Salzer and R. Caferra, eds, Automated Deduction in Classical and Non-Classical Logics, Lecture Notes in Computer Science LNCS/LNAI (Springer-Verlag), vol.1761, pp.175-190, January 2000.
A. Dovier, E. Omodeo, A. Policriti. Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case, Applicable Algebra in Engineering, Communication and Computing (Springer-Verlag), 9(4):292-332, 1999.
A. Dovier, E.G. Omodeo, E. Pontelli, and G.-F. Rossi. A Language for Programming in Logic with Finite Sets, Journal of Logic Programming, Vol. 28, No.1, pp.1-44, June 1996.
postscript
Abstract
[TO BE INSTALLED]
E.G. Omodeo, F. Parlamento, and A. Policriti. Decidability of ∃^*∀-sentences in Membership Theories, Mathematical Logic Quarterly, Vol. 42, No.1, pp.41-58, 1996.
postscript
Abstract
[TO BE INSTALLED]
E.G. Omodeo and A. Policriti. Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case, Communications on Pure and Applied Mathematics, Vol. 48, Nos. 9-10, pp.1123-1155, 1995. (Special issue in honor of J.T. Schwartz)
postscript (To be replaced soon with a version closer to the original)
Abstract
[TO BE INSTALLED]
E.G. Omodeo, F. Parlamento, and A. Policriti. A Derived Algorithm for Evaluating ε-expressions Over Abstract Sets, Journal of Symbolic Computation, 15, pp.673-704, 1993.
postscript
Abstract
[TO BE INSTALLED]
D. Cantone, E.G. Omodeo, and A. Policriti. The automation of syllogistic. II. Optimization and complexity issues, Journal of Automated Reasoning, Kluwer Academic Publishers, The Netherlands, 6(2),173--187, 1990.
E.G. Omodeo, F. Parlamento, and A. Policriti. Truth tables for a combinatorial kernel of set theories. In Luigia Carlucci Aiello ed., Proceedings of the 9th European Conference on Artificial Intelligence (Stockholm, 6--10 Aug. 1990), Pitman, London, 485--490, 1990.
D. Cantone, A. Ferro, and E.G. Omodeo. "Computable Set Theory," Vol.1., Oxford University Press, International Series of Monographs on Computer Science, 347 pp., 1989.
Abstract here
D. Cantone and E.G. Omodeo. Topological syllogistic with continuous and closed functions, Communications on Pure and Applied Mathematics, 42, pp.1175--1188, 1989.
D. Cantone, E.G. Omodeo. On the decidability of formulae involving continuous and closed functions. In N.S. Sridharan ed., IJCAI'89, 11th International Joint Conference on Artificial Intelligence, Proceedings, Vol.1 (Detroit, Michigan, 20--25 August, 1989), pp.425--430, 1989.
D. Cantone, S. Ghelfo, and E.G. Omodeo. The automation of syllogistic. I. Syllogistic normal forms, Journal of Symbolic Computation, Academic Press, London--San Diego, 6(1):83--98, 1988.
D. Aliffi, D. Montanari, E.G. Omodeo. Meta-interpreting SETL. Le Matematiche, 43, pp.79--98, 1988.
D. Cantone, A. Ferro, and E.G. Omodeo. Decision procedures for elementary sublanguages of set theory. VIII. A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae. Communications on Pure and Applied Mathematics, 41, pp.105--120, 1988.
E.G. Omodeo. Hints for the design of a set calculus oriented to Automated Deduction. In M. Boscarol, L. Carlucci Aiello, G. Levi eds., Foundations of Logic and Functional Programming (Workshop, Trento, 15--19 Dec. 1986), 201--218, Lecture Notes in Computer Science, 306, Springer--Verlag, 1988.
D. Cantone, A. Ferro, E.G. Omodeo, J.T. Schwartz. Decision algorithms for some fragments of analysis and related areas. Communications on Pure and Applied Mathematics, 50, pp.281--300, 1987.
E.G. Omodeo. L'automazione della sillogistica, Le Scienze (Italian edition of Scientific American), pp.120--128, Oct. 1986.
S. Ghelfo, E.G. Omodeo. Towards practical implementations of syllogistic. In Bob F. Caviness ed., EUROCAL'85, European Conference on Computer Algebra --- Proceedings Vol.2 (Linz, Austria, 1--3 Apr 1985), pp.40--49, Lecture Notes in Computer Science, 204, Springer--Verlag, 1985.
E.G. Omodeo. The Linked Conjunct method for automatic deduction and related search techniques. Computers and Mathematics with Applications, Pergamon Press, Oxford--New York, 8, pp.185--203, 1982.
M. Breban, A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions. Communications on Pure and Applied Mathematics, 34, pp.177--195, 1981.
A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions. Communications on Pure and Applied Mathematics, John Wiley & Sons, New York, 33, pp.599--608, 1980.
E.G. Omodeo. Three existence principles in a modal calculus without descriptions contained in A. Bressan's MC^ν. Notre Dame Journal of Formal Logic, Indiana, 21(4):711--727, 1980.
A. Ferro, E.G. Omodeo, J.T. Schwartz. Decision procedures for some fragments of set theory. Proceedings of the 5th conference on Automated Deduction, pp.88--96. Lecture Notes in Computer Science, 87, Springer--Verlag, Berlin--Heidelberg--New York, 1980.
A. Ferro and E.G. Omodeo. An efficient validity test for formulae in extensional two-level syllogistic. Le Matematiche, Catania, 33, pp.130--137, 1978.
E.G. Omodeo. The elimination of descriptions from A. Bressan's modal language ML^ν on which the logical calculus MC^ν is based. Rendiconti del Seminario Matematico dell'Università di Padova, 56, pp.270-292, 1977.