Eugenio G. Omodeo

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 29

Top Topics

Davis Putnam Logemann Loveland

Boolean Formula

Transitive Closure

Top Venues

Fundam. Informaticae

Theor. Comput. Sci.

Publications

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)
Domenico Cantone, Eugenio G. Omodeo
Onset and Today's Perspectives of Multilevel Syllogistic. From Computational Logic to Computational Biology (2024)
Wesley Calvert, Valentina S. Harizanov, Eugenio G. Omodeo, Alberto Policriti, Alexandra Shlapentokh
In Memory of Martin Davis. CoRR (2024)
Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà
Some Decidability Issues Concerning C^n Real Functions. CILC (2024)
Simone Boscaratto, Eugenio G. Omodeo, Alberto Policriti
On Generalised Ackermann Encodings - The Basis Issue. CILC (2024)
Alberto Policriti, Eugenio G. Omodeo, Liesbeth De Mol
Obituary of Martin Davis (1928-2023). IEEE Ann. Hist. Comput. 45 (1) (2023)
Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti
Continued Hereditarily Finite Sets Approximations. CILC (2023)
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 (2023)
Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere
0-complexity and axiomatic weakness in undecidability proofs. J. Log. Comput. 33 (4) (2023)
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) (2023)
Domenico Cantone, Luca Cuzziol, Eugenio G. Omodeo
A Brief History of Singlefold Diophantine Definitions. CILC (2023)
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) (2021)
Alberto Casagrande, Eugenio G. Omodeo, Maurizio Proietti
Preface. Fundam. Informaticae 181 (1) (2021)
Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. ICTCS (2021)
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 (2021)
Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà
A Decidable Theory Treating Addition of Differentiable Real Functions. ICTCS (2021)
Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere
Very Weak, Essentially Undecidabile Set Theories. CILC (2021)
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 (2020)
Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory. ICTCS (2020)
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)
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)
Domenico Cantone, Alberto Casagrande, Francesco Fabris, Eugenio G. Omodeo
Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation? CILC (2019)
Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo
Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory. CILC (2019)
Alberto Casagrande, Francesco Di Cosmo, Eugenio G. Omodeo
On Perfect Matchings for some Bipartite Graphs. SETS@ABZ (2018)
Domenico Cantone, Eugenio G. Omodeo
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? CILC (2018)
Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
Set-syllogistics meet combinatorics. Math. Struct. Comput. Sci. 27 (2) (2017)
Luca Vallata, Eugenio G. Omodeo
A Diophantine representation of Wolstenholme's pseudoprimality. CILC (2015)
Eugenio G. Omodeo, Alexandru I. Tomescu
Set Graphs. V. On representing graphs as membership digraphs. J. Log. Comput. 25 (3) (2015)
Giovanna D'Agostino, Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
Mapping Sets and Hypersets into Numbers. Fundam. Informaticae 140 (3-4) (2015)
Rodica Ceterchi, Eugenio G. Omodeo, Alexandru I. Tomescu
The Representation of Boolean Algebras in the Spotlight of a Proof Checker. CILC (2014)
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) (2014)
Eugenio G. Omodeo, Carla Piazza, Alberto Policriti, Alexandru I. Tomescu
Hyper-Extensionality and One-Node Elimination on Membership Graphs. CILC (2014)
Alberto Casagrande, Eugenio G. Omodeo
Reasoning about connectivity without paths. ICTCS (2014)
Eugenio G. Omodeo
Proof Verification within Set Theory. CILC (2013)
Pierpaolo Calligaris, Eugenio G. Omodeo, Alexandru I. Tomescu
A Proof-checking Experiment on Representing Graphs as Membership Digraphs. CILC (2013)
Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
Infinity, in short. J. Log. Comput. 22 (6) (2012)
Eugenio G. Omodeo, Alberto Policriti
The Bernays - Schönfinkel - Ramsey class for set theory: decidability. J. Symb. Log. 77 (3) (2012)
Domenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo
On the Elimination of Quantifiers through Descriptors in Predicate Logic. CILC (2012)
Eugenio G. Omodeo, Alberto Policriti
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. J. Symb. Log. 75 (2) (2010)
Eugenio G. Omodeo, Domenico Cantone, Alberto Policriti, Jacob T. Schwartz
A Computerized Referee. Reasoning, Action and Interaction in AI Theories and Systems (2006)
Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo
Decidability results for sets with atoms. ACM Trans. Comput. Log. 7 (2) (2006)
Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti
The axiom of elementary sets on the edge of Peircean expressibility. J. Symb. Log. 70 (3) (2005)
Ernst-Erich Doberkat, Eugenio G. Omodeo
ER modelling from first relational principles. Theor. Comput. Sci. 311 (1-3) (2004)
Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti
Three-variable statements of set-pairing. Theor. Comput. Sci. 322 (1) (2004)
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)
Domenico Cantone, Andrea Formisano, Eugenio G. Omodeo, Calogero G. Zarba
Compiling dyadic first-order specifications into map algebra. Theor. Comput. Sci. 293 (2) (2003)
Stefania Costantini, Andrea Formisano, Eugenio G. Omodeo
Mappings Between Domain Models in Answer Set Programming. Answer Set Programming (2003)
Stefania Costantini, Andrea Formisano, Eugenio G. Omodeo
Mappings Between Domain Models in Answer Set Programming. APPIA-GULP-PRODE (2003)
Eugenio G. Omodeo, Ewa Orlowska, Alberto Policriti
Rasiowa-Sikorski Style Relational Elementary Set Theory. RelMiCS (2003)
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) (2002)
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)
Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti
Automation of Aggregate Theories: The Cornerstones of Equational Expressibility. APPIA-GULP-PRODE (2002)
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)
Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
Instructing Equational Set-Reasoning with Otter. IJCAR (2001)
Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo
Decidability results for sets with atoms. APPIA-GULP-PRODE (2001)
Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
Layered map reasoning: An experimental approach put to trial on sets. APPIA-GULP-PRODE 48 (2001)
Andrea Formisano, Eugenio G. Omodeo, Marta Simeoni
A graphical approach to relational reasoning. Electron. Notes Theor. Comput. Sci. 44 (3) (2001)
Eugenio G. Omodeo, Ernst-Erich Doberkat
Algebraic semantics of ER-models in the context of the calculus of relations. Electron. Notes Theor. Comput. Sci. 44 (3) (2001)
Ernst-Erich Doberkat, Eugenio G. Omodeo
Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View. RelMiCS (2001)
Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
Goals and Benchmarks for Automated Map Reasoning. J. Symb. Comput. 29 (2) (2000)
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) (1999)
Domenico Cantone, Eugenio G. Omodeo, Pietro Ursino
Transitive Venn diagrams with applications to the decision problem in set theory. APPIA-GULP-PRODE (1999)
Andrea Formisano, Eugenio G. Omodeo
An Equational Re-engineering of Set Theories. FTP (LNCS Selection) (1998)
Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
Plan of Activities on the Map Calculus. APPIA-GULP-PRODE (1998)
Domenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo
Global Skolemization with Grouped Quantifiers. APPIA-GULP-PRODE (1997)
Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
∀-Sentences in Membership Theories. Math. Log. Q. 42 (1996)
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
A Language for Programming in Logic with Finite Sets. J. Log. Program. 28 (1) (1996)
Eugenio G. Omodeo
Solvable set/hyperset context. JFPLC (1995)
Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi
Solving Systems of Equations over Hypersets. GULP-PRODE (1) (1994)
Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. J. Symb. Comput. 15 (5/6) (1993)
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)
Eugenio G. Omodeo, Alberto Policriti
Decision Procedures for Set/Hyperset Contexts. DISCO (1993)
Davide Aliffi, Gianfranco Rossi, Agostino Dovier, Eugenio G. Omodeo
Unification of Hyperset Terms. ICLP Workshop on Logic Programming with Sets (1993)
Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi
Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica? GULP (1993)
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
Embedding Finite Sets in a Logic Programming Language. ELP (1992)
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
{log}: A Logic Programming Language with Finite Sets. ICLP (1991)
Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
Truth Tables for a Combinatorial Kernel of Set Theories. ECAI (1990)
Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti
The Automation of Syllogistic. J. Autom. Reason. 6 (2) (1990)
Domenico Cantone, Eugenio G. Omodeo
On the Decidability of Formulae Involving Continuous and Closed Functions. IJCAI (1989)
Domenico Cantone, Susanna Ghelfo, Eugenio G. Omodeo
The Automation of Syllogistic I. Syllogistic Normal Forms. J. Symb. Comput. 6 (1) (1988)
Eugenio G. Omodeo
Hints for the Design of a Set Calculus Oriented to Automated Deduction. Foundations of Logic and Functional Programming (1986)
Susanna Ghelfo, Eugenio G. Omodeo
Towards Practical Implementations of Syllogistic. European Conference on Computer Algebra (2) (1985)
Alfredo Ferro, Eugenio G. Omodeo, Jacob T. Schwartz
Decision Procedures for Some Fragments of Set Theory. CADE (1980)