Eugenio Omodeo
Eugenio Omodeo
Professore di scienze informatiche, UniversitÓ di Trieste (now retired)
Verified email at units.it
Title
Cited by
Cited by
Year
Set theory for computing: from decision procedures to declarative programming with sets
D Cantone, E Omodeo, A Policriti
Springer Science & Business Media, 2013
1962013
Computable set theory
D Cantone, A Ferro, E Omodeo
Clarendon Press, 1989
1331989
{log}: A language for programming in logic with finite sets
A Dovier, EG Omodeo, E Pontelli, G Rossi
The Journal of logic programming 28 (1), 1-44, 1996
1211996
Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensions
A Ferro, EG Omodeo, JT Schwartz
Communications on pure and Applied Mathematics 33 (5), 599-608, 1980
1131980
flogg: A logic programming language with finite sets
A Dovier, EG Omodeo, E Pontelli, G Rossi
Proc. 8th Int. Conf. on Logic Programming, 1991
781991
Computational logic and set theory: Applying formalized logic to analysis
JT Schwartz, D Cantone, EG Omodeo
Springer Science & Business Media, 2011
592011
Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
M Breban, A Ferro, EG Omodeo, JT Schwartz
Communications on Pure and Applied Mathematics 34 (2), 177-195, 1981
511981
The automation of syllogistic
D Cantone, EG Omodeo, A Policriti
Journal of Automated Reasoning 6 (2), 173-187, 1990
411990
Decision procedures for some fragments of set theory
A Ferro, EG Omodeo, JT Schwartz
International Conference on Automated Deduction, 88-96, 1980
401980
A ‘theory’mechanism for a proof-verifier based on first-order set theory
EG Omodeo, JT Schwartz
Computational Logic: Logic Programming and Beyond, 214-230, 2002
372002
A computerized referee
EG Omodeo, D Cantone, A Policriti, JT Schwartz
Reasoning, Action and Interaction in AI Theories and Systems, 117-139, 2006
362006
Embedding finite sets in a logic programming language
A Dovier, EG Omodeo, E Pontelli, G Rossi
International Workshop on Extensions of Logic Programming, 150-167, 1992
341992
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
EG Omodeo, A Policriti
Communications on Pure and Applied Mathematics 48 (9), 1123-1155, 1995
331995
Notes from the logbook of a proof-checker’s project
D Cantone, EG Omodeo, JT Schwartz, P Ursino
Verification: Theory and Practice, 182-207, 2003
312003
Decidability of∀*∀‐Sentences in Membership Theories
EG Omodeo, F Parlamento, A Policriti
Mathematical Logic Quarterly 42 (1), 41-58, 1996
271996
Set graphs. III. Proof Pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
EG Omodeo, AI Tomescu
Journal of automated reasoning 52 (1), 1-29, 2014
242014
Goals and benchmarks for automated map reasoning
A Formisano, EG Omodeo, M Temperini
Journal of Symbolic Computation 29 (2), 259-297, 2000
242000
An equational re-engineering of set theories
A Formisano, E Omodeo
International Workshop on First-Order Theorem Proving, 175-190, 1998
241998
The Bernays-Sch├ nfinkel-Ramsey class for set theory: semidecidability
E Omodeo, A Policriti
The Journal of Symbolic Logic 75 (2), 459-480, 2010
232010
An efficient validity test for formulae in extensional two-level syllogistic
A Ferro, EG Omodeo
Le Matematiche 33 (1), 130-137, 1978
221978
The system can't perform the operation now. Try again later.
Articles 1–20