default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugenio G. Omodeo
Eugenio Giovanni Omodeo
Person information
SPARQL queries 
🛈 Please note that only 57% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Domenico Cantone
, Eugenio G. Omodeo:
Onset and Today's Perspectives of Multilevel Syllogistic. From Computational Logic to Computational Biology 2024: 9-55- [c53]Alfredo Ferro, Eugenio G. Omodeo:
A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic. From Computational Logic to Computational Biology 2024: 82-95 - [c52]Simone Boscaratto, Eugenio G. Omodeo, Alberto Policriti:
On Generalised Ackermann Encodings - The Basis Issue. CILC 2024 - [c51]Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà:
Some Decidability Issues Concerning C^n Real Functions. CILC 2024 - [i2]Wesley Calvert, Valentina S. Harizanov, Eugenio G. Omodeo, Alberto Policriti, Alexandra Shlapentokh:
In Memory of Martin Davis. CoRR abs/2401.10154 (2024) - 2023
- [j29]Alberto Policriti, Eugenio G. Omodeo, Liesbeth De Mol:
Obituary of Martin Davis (1928-2023). IEEE Ann. Hist. Comput. 45(1): 93-94 (2023) - [j28]Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere:
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs. J. Log. Comput. 33(4): 738-763 (2023) - [j27]Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà:
A decidable theory involving addition of differentiable real functions. Theor. Comput. Sci. 940(Part): 124-148 (2023) - [j26]Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo:
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. Theor. Comput. Sci. 954: 113786 (2023) - [c50]Domenico Cantone, Luca Cuzziol, Eugenio G. Omodeo:
A Brief History of Singlefold Diophantine Definitions. CILC 2023 - [c49]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Continued Hereditarily Finite Sets Approximations. CILC 2023 - 2021
- [j25]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case. Fundam. Informaticae 181(1): 37-69 (2021) - [j24]Alberto Casagrande, Eugenio G. Omodeo, Maurizio Proietti:
Preface. Fundam. Informaticae 181(1) (2021) - [c48]Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere:
Very Weak, Essentially Undecidabile Set Theories. CILC 2021: 31-46 - [c47]Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà:
A Decidable Theory Treating Addition of Differentiable Real Functions. ICTCS 2021: 150-163 - [c46]Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo:
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. ICTCS 2021: 164-178 - [i1]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae. CoRR abs/2112.04797 (2021) - 2020
- [j23]Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo:
Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership. Theor. Comput. Sci. 848: 28-46 (2020) - [c45]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF. CILC 2020: 214-230 - [c44]Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà:
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals. CILC 2020: 231-247 - [c43]Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere:
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory. ICTCS 2020: 47-60
2010 – 2019
- 2019
- [c42]Domenico Cantone, Alberto Casagrande, Francesco Fabris, Eugenio G. Omodeo:
Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation? CILC 2019: 104-122 - [c41]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory. CILC 2019: 123-137 - [e3]Alberto Casagrande, Eugenio G. Omodeo:
Proceedings of the 34th Italian Conference on Computational Logic, Trieste, Italy, June 19-21, 2019. CEUR Workshop Proceedings 2396, CEUR-WS.org 2019 [contents] - 2018
- [c40]Domenico Cantone, Eugenio G. Omodeo:
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? CILC 2018: 147-152 - [c39]Alberto Casagrande, Francesco Di Cosmo, Eugenio G. Omodeo:
On Perfect Matchings for some Bipartite Graphs. SETS@ABZ 2018: 38-51 - 2017
- [b5]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
On Sets and Graphs: Perspectives on Logic and Combinatorics. Springer 2017, ISBN 978-3-319-54981-1 - [j22]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Set-syllogistics meet combinatorics. Math. Struct. Comput. Sci. 27(2): 296-310 (2017) - 2016
- [p5]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Banishing Ultrafilters from Our Consciousness. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 255-283 - [p4]Eugenio G. Omodeo:
Martin Davis's Bibliography 1950-2015. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 363-370 - [e2]Eugenio G. Omodeo, Alberto Policriti:
Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Outstanding Contributions to Logic 10, Springer 2016, ISBN 978-3-319-41841-4 [contents] - 2015
- [j21]Giovanna D'Agostino, Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Mapping Sets and Hypersets into Numbers. Fundam. Informaticae 140(3-4): 307-328 (2015) - [j20]Eugenio G. Omodeo, Alexandru I. Tomescu:
Set Graphs. V. On representing graphs as membership digraphs. J. Log. Comput. 25(3): 899-919 (2015) - [c38]Luca Vallata, Eugenio G. Omodeo:
A Diophantine representation of Wolstenholme's pseudoprimality. CILC 2015: 2-12 - 2014
- [j19]Eugenio G. Omodeo, Alexandru I. Tomescu:
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets. J. Autom. Reason. 52(1): 1-29 (2014) - [c37]Rodica Ceterchi, Eugenio G. Omodeo, Alexandru I. Tomescu:
The Representation of Boolean Algebras in the Spotlight of a Proof Checker. CILC 2014: 287-301 - [c36]Eugenio G. Omodeo, Carla Piazza, Alberto Policriti, Alexandru I. Tomescu:
Hyper-Extensionality and One-Node Elimination on Membership Graphs. CILC 2014: 341-346 - [c35]Alberto Casagrande, Eugenio G. Omodeo:
Reasoning about connectivity without paths. ICTCS 2014: 93-108 - 2013
- [c34]Eugenio G. Omodeo:
Proof Verification within Set Theory. CILC 2013: 11 - [c33]Pierpaolo Calligaris, Eugenio G. Omodeo, Alexandru I. Tomescu:
A Proof-checking Experiment on Representing Graphs as Membership Digraphs. CILC 2013: 227-233 - 2012
- [j18]Domenico Cantone, Andrea Formisano, Marianna Nicolosi Asmundo, Eugenio Giovanni Omodeo:
A graphical representation of relational formulae with complementation. RAIRO Theor. Informatics Appl. 46(2): 261-289 (2012) - [j17]Eugenio G. Omodeo, Alberto Policriti:
The Bernays - Schönfinkel - Ramsey class for set theory: decidability. J. Symb. Log. 77(3): 896-918 (2012) - [j16]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Infinity, in short. J. Log. Comput. 22(6): 1391-1403 (2012) - [c32]Domenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo:
On the Elimination of Quantifiers through Descriptors in Predicate Logic. CILC 2012: 17-31 - 2011
- [b4]Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo:
Computational Logic and Set Theory - Applying Formalized Logic to Analysis. Springer 2011, ISBN 978-0-85729-807-2, pp. I-XVII, 1-416 - 2010
- [j15]Eugenio G. Omodeo, Alberto Policriti:
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. J. Symb. Log. 75(2): 459-480 (2010) - [p3]Andrea Formisano, Eugenio G. Omodeo:
Theory-Specific Automated Reasoning. 25 Years GULP 2010: 37-63
2000 – 2009
- 2006
- [j14]Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo:
Decidability results for sets with atoms. ACM Trans. Comput. Log. 7(2): 269-301 (2006) - [c31]Eugenio G. Omodeo, Domenico Cantone, Alberto Policriti, Jacob T. Schwartz:
A Computerized Referee. Reasoning, Action and Interaction in AI Theories and Systems 2006: 117-139 - [p2]Andrea Formisano, Eugenio G. Omodeo, Ewa Orlowska:
An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics. Theory and Applications of Relational Structures as Knowledge Instruments 2006: 89-104 - 2005
- [j13]Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
The axiom of elementary sets on the edge of Peircean expressibility. J. Symb. Log. 70(3): 953-968 (2005) - 2004
- [j12]Ernst-Erich Doberkat, Eugenio G. Omodeo:
ER modelling from first relational principles. Theor. Comput. Sci. 311(1-3): 285-323 (2004) - [j11]Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
Three-variable statements of set-pairing. Theor. Comput. Sci. 322(1): 147-173 (2004) - 2003
- [j10]Domenico Cantone, Andrea Formisano, Eugenio G. Omodeo, Calogero G. Zarba:
Compiling dyadic first-order specifications into map algebra. Theor. Comput. Sci. 293(2): 447-475 (2003) - [c30]Eugenio G. Omodeo, Ewa Orlowska, Alberto Policriti:
Rasiowa-Sikorski Style Relational Elementary Set Theory. RelMiCS 2003: 215-226 - [c29]Stefania Costantini, Andrea Formisano, Eugenio G. Omodeo:
Mappings Between Domain Models in Answer Set Programming. APPIA-GULP-PRODE 2003: 147-158 - [c28]Stefania Costantini, Andrea Formisano, Eugenio G. Omodeo:
Mappings Between Domain Models in Answer Set Programming. Answer Set Programming 2003 - [c27]Domenico Cantone, Eugenio G. Omodeo, Jacob T. Schwartz, Pietro Ursino:
Notes from the Logbook of a Proof-Checker's Project. Verification: Theory and Practice 2003: 182-207 - [p1]Pasquale Caianiello, Stefania Costantini, Eugenio G. Omodeo:
An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them: I: Language Extension Mechanisms. Theory and Applications of Relational Structures as Knowledge Instruments 2003: 87-106 - 2002
- [j9]Domenico Cantone, Pietro Ursino, Eugenio G. Omodeo:
Formative Processes with Applications to the Decision Problem in Set Theory, I. Powerset and Singleton Operators. Inf. Comput. 172(2): 165-201 (2002) - [c26]Pasquale Caianiello, Stefania Costantini, Eugenio G. Omodeo:
An Environment for Stepwise Map Specification and Reasoning in Prolog I: Three Language Extension Mechanisms. APPIA-GULP-PRODE 2002: 87- - [c25]Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
Automation of Aggregate Theories: The Cornerstones of Equational Expressibility. APPIA-GULP-PRODE 2002: 275- - [c24]Eugenio G. Omodeo, Jacob T. Schwartz:
A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory. Computational Logic: Logic Programming and Beyond 2002: 214-230 - 2001
- [b3]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science, Springer 2001, ISBN 978-1-4419-2905-1, pp. 1-409 - [c23]Ernst-Erich Doberkat, Eugenio G. Omodeo:
Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View. RelMiCS 2001: 50-65 - [c22]Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo:
Decidability results for sets with atoms. APPIA-GULP-PRODE 2001: 245-259 - [c21]Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Instructing Equational Set-Reasoning with Otter. IJCAR 2001: 152-167 - [c20]Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Layered map reasoning: An experimental approach put to trial on sets. APPIA-GULP-PRODE 2001: 1-28 - [c19]Eugenio G. Omodeo, Ernst-Erich Doberkat:
Algebraic semantics of ER-models in the context of the calculus of relations. RelMiS 2001: 136-152 - [c18]Andrea Formisano, Eugenio G. Omodeo, Marta Simeoni:
A graphical approach to relational reasoning. RelMiS 2001: 153-174 - 2000
- [j8]Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Goals and Benchmarks for Automated Map Reasoning. J. Symb. Comput. 29(2): 259-297 (2000)
1990 – 1999
- 1999
- [j7]Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti:
Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case. Appl. Algebra Eng. Commun. Comput. 9(4): 293-332 (1999) - [c17]Domenico Cantone, Eugenio G. Omodeo, Pietro Ursino:
Transitive Venn diagrams with applications to the decision problem in set theory. APPIA-GULP-PRODE 1999: 167-182 - 1998
- [c16]Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Plan of Activities on the Map Calculus. APPIA-GULP-PRODE 1998: 343-356 - [c15]Andrea Formisano, Eugenio G. Omodeo:
An Equational Re-engineering of Set Theories. FTP (LNCS Selection) 1998: 175-190 - 1997
- [c14]Domenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo:
Global Skolemization with Grouped Quantifiers. APPIA-GULP-PRODE 1997: 405-414 - 1996
- [j6]Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi:
A Language for Programming in Logic with Finite Sets. J. Log. Program. 28(1): 1-44 (1996) - [j5]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Decidability of ∃*∀-Sentences in Membership Theories. Math. Log. Q. 42: 41-58 (1996) - 1995
- [c13]Eugenio G. Omodeo:
Solvable set/hyperset context. JFPLC 1995: 429 - 1994
- [c12]Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi:
Solving Systems of Equations over Hypersets. GULP-PRODE (1) 1994: 403-417 - 1993
- [j4]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. J. Symb. Comput. 15(5/6): 673-704 (1993) - [c11]Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi:
Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica? GULP 1993: 55-70 - [c10]Eugenio G. Omodeo, Alberto Policriti:
Decision Procedures for Set/Hyperset Contexts. DISCO 1993: 192-215 - [c9]Davide Aliffi, Gianfranco Rossi, Agostino Dovier, Eugenio G. Omodeo:
Unification of Hyperset Terms. ICLP Workshop on Logic Programming with Sets 1993 - [c8]Paola Bruscoli, Gianfranco Rossi, Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli:
Extensional and Intensional Sets in CLP with Intensional Negation. ICLP Workshop on Logic Programming with Sets 1993 - [e1]Eugenio G. Omodeo, Gianfranco Rossi:
Workshop on Logic Programming with Sets, in conjunction with ICLP 1993, Budapest, Hungary, June 24, 1993. 1993 [contents] - 1992
- [c7]Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi:
Embedding Finite Sets in a Logic Programming Language. ELP 1992: 150-167 - 1991
- [c6]Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi:
{log}: A Logic Programming Language with Finite Sets. ICLP 1991: 111-124 - 1990
- [j3]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
The Automation of Syllogistic. J. Autom. Reason. 6(2): 173-187 (1990) - [c5]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Truth Tables for a Combinatorial Kernel of Set Theories. ECAI 1990: 485-490
1980 – 1989
- 1989
- [b2]Domenico Cantone, Alfredo Ferro, Eugenio G. Omodeo:
Computable set theory. Volume 1. The international series of monographs on computer science 6, Clarendon Press / Oxford University Press 1989, ISBN 0-19-853807-3 - [c4]Domenico Cantone, Eugenio G. Omodeo:
On the Decidability of Formulae Involving Continuous and Closed Functions. IJCAI 1989: 425-430 - 1988
- [j2]Domenico Cantone, Susanna Ghelfo, Eugenio G. Omodeo:
The Automation of Syllogistic I. Syllogistic Normal Forms. J. Symb. Comput. 6(1): 83-98 (1988) - 1986
- [c3]Eugenio G. Omodeo:
Hints for the Design of a Set Calculus Oriented to Automated Deduction. Foundations of Logic and Functional Programming 1986: 201-218 - 1985
- [c2]Susanna Ghelfo, Eugenio G. Omodeo:
Towards Practical Implementations of Syllogistic. European Conference on Computer Algebra (2) 1985: 40-49 - 1984
- [b1]Eugenio G. Omodeo:
Decidability and Proof Procedures for Set Theory with a Choice Operator. New York University, USA, 1984 - 1980
- [j1]Eugenio Giovanni Omodeo:
Three existence principles in a modal calculus without descriptions contained in A. Bressan's MCν. Notre Dame J. Formal Log. 21(4): 711-727 (1980) - [c1]Alfredo Ferro, Eugenio G. Omodeo, Jacob T. Schwartz:
Decision Procedures for Some Fragments of Set Theory. CADE 1980: 88-96
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
