Eugenio G. Omodeo

Orcid: 0000-0003-3917-1942

According to our database1, Eugenio G. Omodeo authored at least 93 papers between 1980 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
In Memory of Martin Davis.
CoRR, 2024

Some Decidability Issues Concerning C^n Real Functions.
Proceedings of the 39th Italian Conference on Computational Logic, 2024

On Generalised Ackermann Encodings - The Basis Issue.
Proceedings of the 39th Italian Conference on Computational Logic, 2024

A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic.
Proceedings of the From Computational Logic to Computational Biology, 2024

Onset and Today's Perspectives of Multilevel Syllogistic.
Proceedings of the From Computational Logic to Computational Biology, 2024

2023
Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs.
J. Log. Comput., June, 2023

Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages.
Theor. Comput. Sci., 2023

A decidable theory involving addition of differentiable real functions.
Theor. Comput. Sci., 2023

Obituary of Martin Davis (1928-2023).
IEEE Ann. Hist. Comput., 2023

Continued Hereditarily Finite Sets Approximations.
Proceedings of the 38th Italian Conference on Computational Logic, 2023

A Brief History of Singlefold Diophantine Definitions.
Proceedings of the 38th Italian Conference on Computational Logic, 2023

2021
Preface.
Fundam. Informaticae, 2021

Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case.
Fundam. Informaticae, 2021

Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae.
CoRR, 2021

Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

A Decidable Theory Treating Addition of Differentiable Real Functions.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Very Weak, Essentially Undecidabile Set Theories.
Proceedings of the 36th Italian Conference on Computational Logic, 2021

2020
Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership.
Theor. Comput. Sci., 2020

From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019
Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory.
Proceedings of the 34th Italian Conference on Computational Logic, 2019

Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation?
Proceedings of the 34th Italian Conference on Computational Logic, 2019

2018
On Perfect Matchings for some Bipartite Graphs.
Proceedings of the 3rd International Workshop on Sets and Tools co-located with the 6th International ABZ Conference, 2018

Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation?
Proceedings of the 33rd Italian Conference on Computational Logic, 2018

2017
Set-syllogistics meet combinatorics.
Math. Struct. Comput. Sci., 2017

On Sets and Graphs: Perspectives on Logic and Combinatorics
Springer, ISBN: 978-3-319-54980-4, 2017

2016
Martin Davis's Bibliography 1950-2015.
Proceedings of the Martin Davis on Computability, 2016

Banishing Ultrafilters from Our Consciousness.
Proceedings of the Martin Davis on Computability, 2016

2015
Set Graphs. V. On representing graphs as membership digraphs.
J. Log. Comput., 2015

Mapping Sets and Hypersets into Numbers.
Fundam. Informaticae, 2015

A Diophantine representation of Wolstenholme's pseudoprimality.
Proceedings of the 30th Italian Conference on Computational Logic, 2015

2014
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets.
J. Autom. Reason., 2014

Reasoning about connectivity without paths.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Hyper-Extensionality and One-Node Elimination on Membership Graphs.
Proceedings of the 29th Italian Conference on Computational Logic, 2014

The Representation of Boolean Algebras in the Spotlight of a Proof Checker.
Proceedings of the 29th Italian Conference on Computational Logic, 2014

2013
Proof Verification within Set Theory.
Proceedings of the 28th Italian Conference on Computational Logic, 2013

A Proof-checking Experiment on Representing Graphs as Membership Digraphs.
Proceedings of the 28th Italian Conference on Computational Logic, 2013

2012
Infinity, in short.
J. Log. Comput., 2012

The Bernays - Schönfinkel - Ramsey class for set theory: decidability.
J. Symb. Log., 2012

A graphical representation of relational formulae with complementation.
RAIRO Theor. Informatics Appl., 2012

On the Elimination of Quantifiers through Descriptors in Predicate Logic.
Proceedings of the 9th Italian Convention on Computational Logic, 2012

2011
Computational Logic and Set Theory - Applying Formalized Logic to Analysis.
Springer, ISBN: 978-0-85729-807-2, 2011

2010
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability.
J. Symb. Log., 2010

Theory-Specific Automated Reasoning.
Proceedings of the A 25-Year Perspective on Logic Programming: Achievements of the Italian Association for Logic Programming, 2010

2006
Decidability results for sets with atoms.
ACM Trans. Comput. Log., 2006

A Computerized Referee.
Proceedings of the Reasoning, 2006

An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics.
Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments II, 2006

2005
The axiom of elementary sets on the edge of Peircean expressibility.
J. Symb. Log., 2005

2004
Three-variable statements of set-pairing.
Theor. Comput. Sci., 2004

ER modelling from first relational principles.
Theor. Comput. Sci., 2004

2003
Compiling dyadic first-order specifications into map algebra.
Theor. Comput. Sci., 2003

Notes from the Logbook of a Proof-Checker's Project.
Proceedings of the Verification: Theory and Practice, 2003

Mappings Between Domain Models in Answer Set Programming.
Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

Rasiowa-Sikorski Style Relational Elementary Set Theory.
Proceedings of the Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 2003

An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them: I: Language Extension Mechanisms.
Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments, 2003

2002
Formative Processes with Applications to the Decision Problem in Set Theory, I. Powerset and Singleton Operators.
Inf. Comput., 2002

A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory.
Proceedings of the Computational Logic: Logic Programming and Beyond, 2002

Automation of Aggregate Theories: The Cornerstones of Equational Expressibility.
Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

An Environment for Stepwise Map Specification and Reasoning in Prolog I: Three Language Extension Mechanisms.
Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

2001
Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets
Monographs in Computer Science, Springer, ISBN: 978-1-4757-3452-2, 2001

Algebraic semantics of ER-models in the context of the calculus of relations.
Proceedings of the First International Workshop on Relational Methods in Software, 2001

Layered map reasoning: An experimental approach put to trial on sets.
Proceedings of the Declarative Programming, 2001

A graphical approach to relational reasoning.
Proceedings of the First International Workshop on Relational Methods in Software, 2001

Instructing Equational Set-Reasoning with Otter.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View.
Proceedings of the Relational Methods in Computer Science, 2001

2000
Goals and Benchmarks for Automated Map Reasoning.
J. Symb. Comput., 2000

1999
Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case.
Appl. Algebra Eng. Commun. Comput., 1999

Transitive Venn diagrams with applications to the decision problem in set theory.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998
An Equational Re-engineering of Set Theories.
Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

Plan of Activities on the Map Calculus.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
Global Skolemization with Grouped Quantifiers.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
Decidability of ∃<sup>*</sup>∀-Sentences in Membership Theories.
Math. Log. Q., 1996

A Language for Programming in Logic with Finite Sets.
J. Log. Program., 1996

1995
Solvable set/hyperset context.
Proceedings of the JFPLC'95, 1995

1994
Solving Systems of Equations over Hypersets.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993
A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets.
J. Symb. Comput., 1993

Extensional and Intensional Sets in CLP with Intensional Negation.
Proceedings of the Workshop on Logic Programming with Sets, 1993

Unification of Hyperset Terms.
Proceedings of the Workshop on Logic Programming with Sets, 1993

Decision Procedures for Set/Hyperset Contexts.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica?
Proceedings of the 8th Italian Conference on Logic Programming, 1993

1992
Embedding Finite Sets in a Logic Programming Language.
Proceedings of the Extensions of Logic Programming, Third International Workshop, 1992

1991
{log}: A Logic Programming Language with Finite Sets.
Proceedings of the Logic Programming, 1991

1990
The Automation of Syllogistic.
J. Autom. Reason., 1990

Truth Tables for a Combinatorial Kernel of Set Theories.
Proceedings of the 9th European Conference on Artificial Intelligence, 1990

1989
On the Decidability of Formulae Involving Continuous and Closed Functions.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Computable set theory. Volume 1.
The international series of monographs on computer science 6, Clarendon Press / Oxford University Press, ISBN: 9780198538073, 1989

1988
The Automation of Syllogistic I. Syllogistic Normal Forms.
J. Symb. Comput., 1988

1986
Hints for the Design of a Set Calculus Oriented to Automated Deduction.
Proceedings of the Foundations of Logic and Functional Programming, 1986

1985
Towards Practical Implementations of Syllogistic.
Proceedings of the EUROCAL '85, 1985

1984
Decidability and Proof Procedures for Set Theory with a Choice Operator.
PhD thesis, 1984

1980
Three existence principles in a modal calculus without descriptions contained in A. Bressan's MC<sup>ν</sup>.
Notre Dame J. Formal Log., 1980

Decision Procedures for Some Fragments of Set Theory.
Proceedings of the 5th Conference on Automated Deduction, 1980


  Loading...