Andrea De Domenico

Orcid: 0000-0002-8973-7011

According to our database1, Andrea De Domenico authored at least 17 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Obligations and permissions on selfextensional logics.
CoRR, 2024

2023
A Meta-Learning Algorithm for Interrogative Agendas.
CoRR, 2023

Non-distributive Description Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

Labelled Calculi for the Logics of Rough Concepts.
Proceedings of the Logic and Its Applications - 10th Indian Conference, 2023

Labelled Calculi for Lattice-Based Modal Logics.
Proceedings of the Logic and Its Applications - 10th Indian Conference, 2023

2022
Unified inverse correspondence for DLE-Logics.
CoRR, 2022

Modal reduction principles across relational semantics.
CoRR, 2022

Subordination Algebras as Semantic Environment of Input/Output Logic.
Proceedings of the Logic, Language, Information, and Computation, 2022

Algorithmic correspondence and analytic rules.
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

EGITH - Engendering Data. Steps Towards an Ontology for the Representation of Gender in Cultural Heritage.
Proceedings of the 1st Workshop on Artificial Intelligence for Cultural Heritage, 2022

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

On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

2020
An Ontology for the Iconographic Sources of La Divina Commedia.
Proceedings of the 35th Italian Conference on Computational Logic, 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

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

2008
SeSaR: Security for Safety.
Proceedings of the International Workshop on Computational Intelligence in Security for Information Systems, 2008


  Loading...