Eugenio G. Omodeo

Domenico Cantone, Andrea Formisano, Marianna Nicolosi Asmundo, Eugenio Giovanni Omodeo: A graphical representation of relational formulae with complementation. RAIRO - Theor. Inf. and Applic. 46(2): 261-289 (2012)

Eugenio G. Omodeo, Alberto Policriti: The Bernays - Schönfinkel - Ramsey class for set theory: decidability. J. Symb. Log. 77(3): 896-918 (2012)

Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu: Infinity, in short. J. Log. Comput. 22(6): 1391-1403 (2012)

Domenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo: On the Elimination of Quantifiers through Descriptors in Predicate Logic. CILC 2012: 17-31

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

Eugenio G. Omodeo, Alberto Policriti: The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. J. Symb. Log. 75(2): 459-480 (2010)

Andrea Formisano, Eugenio G. Omodeo: Theory-Specific Automated Reasoning. 25 Years GULP 2010: 37-63

Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo: Decidability results for sets with atoms. ACM Trans. Comput. Log. 7(2): 269-301 (2006)

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

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

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)

Ernst-Erich Doberkat, Eugenio G. Omodeo: ER modelling from first relational principles. Theor. Comput. Sci. 311(1-3): 285-323 (2004)

Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti: Three-variable statements of set-pairing. Theor. Comput. Sci. 322(1): 147-173 (2004)

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)

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

Eugenio G. Omodeo, Ewa Orlowska, Alberto Policriti: Rasiowa-Sikorski Style Relational Elementary Set Theory. RelMiCS 2003: 215-226

Stefania Costantini, Andrea Formisano, Eugenio G. Omodeo: Mappings Between Domain Models in Answer Set Programming. APPIA-GULP-PRODE 2003: 147-158

Stefania Costantini, Andrea Formisano, Eugenio G. Omodeo: Mappings Between Domain Models in Answer Set Programming. Answer Set Programming 2003

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

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)

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

Eugenio G. Omodeo, Ernst-Erich Doberkat: Algebraic semantics of ER-models in the context of the calculus of relations. Electr. Notes Theor. Comput. Sci. 44(3): 136-152 (2001)

Andrea Formisano, Eugenio G. Omodeo, Marta Simeoni: A graphical approach to relational reasoning. Electr. Notes Theor. Comput. Sci. 44(3): 153-174 (2001)

Andrea Formisano, Eugenio G. Omodeo, Marco Temperini: Layered map reasoning: An experimental approach put to trial on sets. Electr. Notes Theor. Comput. Sci. 48: 1-28 (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: 50-65

Andrea Formisano, Eugenio G. Omodeo, Marco Temperini: Instructing Equational Set-Reasoning with Otter. IJCAR 2001: 152-167

Andrea Formisano, Eugenio G. Omodeo, Marco Temperini: Goals and Benchmarks for Automated Map Reasoning. J. Symb. Comput. 29(2): 259-297 (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): 293-332 (1999)

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

Andrea Formisano, Eugenio G. Omodeo, Marco Temperini: Plan of Activities on the Map Calculus. APPIA-GULP-PRODE 1998: 343-356

Andrea Formisano, Eugenio G. Omodeo: An Equational Re-engineering of Set Theories. FTP (LNCS Selection) 1998: 175-190

Domenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo: Global Skolemization with Grouped Quantifiers. APPIA-GULP-PRODE 1997: 405-414

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)

Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti: Decidability of exist^*forall-Sentences in Membership Theories. Math. Log. Q. 42: 41-58 (1996)

Eugenio G. Omodeo: Solvable set/hyperset context. JFPLC 1995: 429

Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi: Solving Systems of Equations over Hypersets. GULP-PRODE (1) 1994: 403-417

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)

Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi: Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica? GULP 1993: 55-70

Eugenio G. Omodeo, Alberto Policriti: Decision Procedures for Set/Hyperset Contexts. DISCO 1993: 192-215

Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi: Embedding Finite Sets in a Logic Programming Language. ELP 1992: 150-167

Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi: {log}: A Logic Programming Language with Finite Sets. ICLP 1991: 111-124

Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti: The Automation of Syllogistic. J. Autom. Reasoning 6(2): 173-187 (1990)

Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti: Truth Tables for a Combinatorial Kernel of Set Theories. ECAI 1990: 485-490

Domenico Cantone, Eugenio G. Omodeo: On the Decidability of Formulae Involving Continuous and Closed Functions. IJCAI 1989: 425-430

Domenico Cantone, Susanna Ghelfo, Eugenio G. Omodeo: The Automation of Syllogistic I. Syllogistic Normal Forms. J. Symb. Comput. 6(1): 83-98 (1988)

Eugenio G. Omodeo: Hints for the Design of a Set Calculus Oriented to Automated Deduction. Foundations of Logic and Functional Programming 1986: 201-218

Susanna Ghelfo, Eugenio G. Omodeo: Towards Practical Implementations of Syllogistic. European Conference on Computer Algebra (2) 1985: 40-49

Alfredo Ferro, Eugenio G. Omodeo, Jacob T. Schwartz: Decision Procedures for Some Fragments of Set Theory. CADE 1980: 88-96