E-LIB Suche - Ergebnisse für: Omodeo, Eugenio G.

1

A Sound and Complete Validity Test for Formulas in Extensio..:

, In: Lecture Notes in Computer Science; From Computational Logic to Computational Biology,

Ferro, Alfredo ; Omodeo, Eugenio G. - p. 82-95 , 2024

Link: https://doi.org/10.1007/..

2

Onset and Today's Perspectives of Multilevel Syllogistic:

, In: Lecture Notes in Computer Science; From Computational Logic to Computational Biology,

Cantone, Domenico ; Omodeo, Eugenio G. - p. 9-55 , 2024

Link: https://doi.org/10.1007/..

3

A decidable theory involving addition of differentiable rea..:

Buriola, Gabriele ; Cantone, Domenico ; Cincotti, Gianluca..
Theoretical Computer Science. 940 (2023) - p. 124-148 , 2023

Link: https://doi.org/10.1016/..

4

Complexity assessments for decidable fragments of Set Theor..:

Cantone, Domenico ; Maugeri, Pietro ; Omodeo, Eugenio G.
Theoretical Computer Science. 954 (2023) - p. 113786 , 2023

Link: https://doi.org/10.1016/..

5

Reconciling transparency, low Δ0-complexity and axiomatic w..:

Cantone, Domenico ; Omodeo, Eugenio G ; Panettiere, Mattia
Journal of Logic and Computation. 33 (2023) 4 - p. 738-763 , 2023

Link: https://doi.org/10.1093/..

6

Complexity assessments for decidable fragments of set theor..:

Cantone, Domenico ; Maugeri, Pietro ; Omodeo, Eugenio G.
Theoretical Computer Science. 848 (2020) - p. 28-46 , 2020

Link: https://doi.org/10.1016/..

7

Set-syllogistics meet combinatorics:

OMODEO, EUGENIO G. ; POLICRITI, ALBERTO ; TOMESCU, ALEXANDRU I.
Mathematical Structures in Computer Science. 27 (2015) 2 - p. 296-310 , 2015

Link: https://doi.org/10.1017/..

8

Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored int..:

Omodeo, Eugenio G. ; Tomescu, Alexandru I.
Journal of Automated Reasoning. 52 (2012) 1 - p. 1-29 , 2012

Link: https://doi.org/10.1007/..

9

Decidability results for sets with atoms:

Dovier, Agostino ; Formisano, Andrea ; Omodeo, Eugenio G.
ACM Transactions on Computational Logic (TOCL). 7 (2006) 2 - p. 269-301 , 2006

Link: https://dl.acm.org/doi/1..

10

Decidability results for sets with atoms:

Dovier, Agostino ; Formisano, Andrea ; Omodeo, Eugenio G.
ACM Transactions on Computational Logic. 7 (2006) 2 - p. 269-301 , 2006

Link: https://doi.org/10.1145/..

11

The Axiom of Elementary Sets on the Edge of Peircean Expres..:

Formisano, Andrea ; Omodeo, Eugenio G. ; Policriti, Alberto
The Journal of Symbolic Logic. 70 (2005) 3 - p. 953-968 , 2005

Link: https://www.jstor.org/st..

12

Three-variable statements of set-pairing:

Formisano, Andrea ; Omodeo, Eugenio G ; Policriti, Alberto
Theoretical Computer Science. 322 (2004) 1 - p. 147-173 , 2004

Link: https://doi.org/10.1016/..

13

ER modelling from first relational principles:

Doberkat, Ernst-Erich ; Omodeo, Eugenio G.
Theoretical Computer Science. 311 (2004) 1-3 - p. 285-323 , 2004

Link: https://doi.org/10.1016/..

14

Algebraic semantics of ER-models in the context of the calc..:

Omodeo, Eugenio G. ; Doberkat, Ernst-Erich
Electronic Notes in Theoretical Computer Science. 44 (2003) 3 - p. 136-152 , 2003

Link: https://doi.org/10.1016/..

15

A graphical approach to relational reasoning1 1This researc..:

Formisano, Andrea. ; Omodeo, Eugenio G. ; Simeoni, Marta
Electronic Notes in Theoretical Computer Science. 44 (2003) 3 - p. 153-174 , 2003

Link: https://doi.org/10.1016/..