Ottavio M. D'Antona

Orcid: 0000-0003-3903-063X

According to our database1, Ottavio M. D'Antona authored at least 33 papers between 1978 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Dyck-Eulerian digraphs.
Electron. Notes Discret. Math., 2018

2016
Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles.
Discret. Math., 2016

2014
The logical content of triangular bases of fuzzy sets in Łukasiewicz infinite-valued logic.
Fuzzy Sets Syst., 2014

A simple combinatorial interpretation of certain generalized Bell and Stirling numbers.
Discret. Math., 2014

Eulerian digraphs and Dyck words, a bijection.
CoRR, 2014

Characterizing and computing stable models of logic programs: The non-stratified case.
CoRR, 2014

2013
Independent subsets of powers of paths, and Fibonacci cubes.
Electron. Notes Discret. Math., 2013

Making simple proofs simpler.
CoRR, 2013

Building Bricks with Bricks, with Mathematica.
CoRR, 2013

Investigating independent subsets of graphs, with Mathematica.
CoRR, 2013

2012
Valuations in Gödel Logic, and the Euler Characteristic.
J. Multiple Valued Log. Soft Comput., 2012

On the independent subsets of powers of paths and cycles
CoRR, 2012

2011
Computing Minimal Axiomatizations in Gödel Propositional Logic.
J. Log. Comput., 2011

2010
The Euler Characteristic of a Formula in Godel Logic.
Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

2009
An analysis of Ruspini partitions in Gödel logic.
Int. J. Approx. Reason., 2009

A characterisation of bases of triangular fuzzy sets.
Proceedings of the FUZZ-IEEE 2009, 2009

Open Partitions and Probability Assignments in Gödel Logic.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2009

2007
Propositional Goedel Logic and Delannoy Paths.
Proceedings of the FUZZ-IEEE 2007, 2007

Best Approximation of Ruspini Partitions in Gödel Logic.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2007

2006
Computing coproducts of finitely presented Gödel algebras.
Ann. Pure Appl. Log., 2006

2005
A combinatorial interpretation of the connection constants for persistent sequences of polynomials.
Eur. J. Comb., 2005

Brun Normal Forms for Co-atomic Lukasiewicz Logics.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005

2002
On the equivalence and range of applicability of graph-based representations of logic programs.
Inf. Process. Lett., 2002

2001
The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots.
Discret. Math., 2001

2000
A Combinatorial Interpretation of Punctured Partitions.
J. Comb. Theory A, 2000

The Cycle-Path Indicator Polynomial of a Digraph.
Adv. Appl. Math., 2000

1998
ANATEMA: a neural approach to extended markup of SGML documents.
Proceedings of the 1998 ACM symposium on Applied Computing, 1998

1994
Decompositions of B<sub>n</sub> and PI<sub>n</sub> Using Symmetric Chains.
J. Comb. Theory A, 1994

Whitney Numbers of Some Geometric Lattices.
J. Comb. Theory A, 1994

1992
The design of a microkernel application platform for shop-floor automation extended abstract.
Future Gener. Comput. Syst., 1992

1985
Connecting Two Rings underlying the Inclusion-Exclusion Principle.
J. Comb. Theory A, 1985

1980
Coherent orientations and series-parallel networks.
Discret. Math., 1980

1978
Two Rings Connected with the Inclusion-Exclusion Principle.
J. Comb. Theory A, 1978


  Loading...