World's Best Scientists 2026 revealed!
Francesco M. Donini

Francesco M. Donini

D-Index & Metrics

Computer Science

D-Index
40
Citations
7894
World Ranking
9210
National Ranking
259

Overview

Francesco M. Donini is affiliated with Tuscia University in Italy and specializes in Computer Science with a focus on Artificial Intelligence and Information Systems. Their research encompasses multiple subfields, including Molecular Biology, Information Systems and Management, and Management Information Systems. The scientist's work predominantly addresses topics such as Semantic Web and Ontologies, Recommender Systems and Techniques, Topic Modeling, and Biomedical Text Mining and Ontologies. Additional areas of expertise include Advanced Graph Neural Networks, Scientific Computing and Data Management, and Explainable Artificial Intelligence (XAI).

Their recent publications include:

  • "A Formal Approach to Ontology-Based Semantic Match of Skills Descriptions" (2020, TUGraz OPEN Library - Graz University of Technology)
  • "Semantic-based Approach to Task Assignment of Individual Profiles" (2020, TUGraz OPEN Library - Graz University of Technology)
  • "Semantic-based Skill Management for Automated Task Assignment and Courseware Composition" (2020, TUGraz OPEN Library - Graz University of Technology)
  • "A qualitative analysis of knowledge graphs in recommendation scenarios through semantics-aware autoencoders" (2024, Journal of Intelligent Information Systems)
  • "Conversational recommendation: Theoretical model and complexity analysis" (2022, Information Sciences)

Frequent coauthors with whom Francesco M. Donini has collaborated include:

  • Eugenio Di Sciascio
  • Simona Colucci
  • Tommaso Di Noia
  • Claudio Pomo
  • Azzurra Ragone

The main venues where this scientist's research has been published are:

  • TUGraz OPEN Library (Graz University of Technology)
  • arXiv (Cornell University)
  • Journal of Intelligent Information Systems
  • Information Sciences
  • ACM SIGIR Forum

Best Publications

  • Reasoning in description logics

    Francesco M. Donini;Maurizio lenzerini;Daniele Nardi;Andrea Schaerf

  • The complexity of concept languages

    Werner Nutt;Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi

  • {\cal A}{\cal L} -log: Integrating Datalog and Description Logics

    Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Andrea Schaerf

  • A System for Principled Matchmaking in an Electronic Marketplace

    Tommaso Di Noia;Eugenio Di Sciascio;Francesco M. Donini;Marina Mongiello

  • Decidable reasoning in terminological knowledge representation systems

    Martin Buchheit;Francesco M. Donini;Andrea Schaerf

  • Description logics of minimal knowledge and negation as failure

    Francesco M. Donini;Daniele Nardi;Riccardo Rosati

  • A survey on knowledge compilation

    Marco Cadoli;Francesco M. Donini

  • The Complexity of Concept Languages.

    Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Werner Nutt

  • An epistemic operator for description logics

    F. M. Donini;M. Lenzerini;D. Nardi;W. Nutt

  • EXP TIME tableaux for ALC

    Francesco M. Donini;Fabio Massacci

  • Tractable concept languages

    Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Werner Nutt

  • Concept abduction and contraction for semantic-based discovery of matches and negotiation spaces in an e-marketplace

    Simona Colucci;Tommaso Di Noia;Eugenio Di Sciascio;Francesco M. Donini

  • Deduction in Concept Languages: from Subsumption to Instance Checking

    Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Andrea Schaerf

  • The complexity of existential quantification in concept languages

    Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Bernhard Hollunder

  • Elliot: A Comprehensive and Rigorous Framework for Reproducible Recommender Systems Evaluation

    Vito Walter Anelli;Alejandro Bellogin;Antonio Ferrara;Daniele Malitesta

  • Semantic matchmaking as non-monotonic reasoning: a description logic approach

    Tommaso Di Noia;Eugenio Di Sciascio;Francesco M. Donini

  • Adding Epistemic Operators to Concept Languages.

    Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Andrea Schaerf

  • A Formal Approach to Ontology-Based Semantic Match of Skills Descriptions.

    Simona Colucci;Tommaso Di Noia;Eugenio Di Sciascio;Francesco M. Donini

  • Complexity of reasoning

    Francesco M. Donini

  • Abductive matchmaking using description logics

    Tommaso Di Noia;Eugenio Di Sciascio;Francesco M. Donini;Marina Mongiello

  • Exptime Tableaux for ALC.

    Giuseppe De Giacomo;Francesco M. Donini;Fabio Massacci

Frequent Co-Authors

Eugenio Di Sciascio
Eugenio Di Sciascio Polytechnic University of Bari
Tommaso Di Noia
Tommaso Di Noia Polytechnic University of Bari
Daniele Nardi
Daniele Nardi Sapienza University of Rome
Maurizio Lenzerini
Maurizio Lenzerini Sapienza University of Rome
Andrea Schaerf
Andrea Schaerf University of Udine
Werner Nutt
Werner Nutt Free University of Bozen-Bolzano
Fabio Massacci
Fabio Massacci Vrije Universiteit Amsterdam
Riccardo Rosati
Riccardo Rosati Sapienza University of Rome
Umberto Straccia
Umberto Straccia National Research Council (CNR)
Diego Calvanese
Diego Calvanese Free University of Bozen-Bolzano

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Considering a career in computer science opens various doors beyond traditional on-campus degrees. Many students start with flexible online options, such as 1 year associate degree programs online. These are beneficial for those seeking quick entry into the tech industry or wishing to build foundational knowledge before pursuing a bachelor’s degree.

Cost is a significant concern for many learners. Some institutions offer cheap online degrees fast, allowing students to minimize debt while gaining valuable credentials at an accelerated pace. These programs often provide the same accreditation and job prospects as their on-campus counterparts.

Not all students have high GPAs, but opportunities still exist. There are reputable online colleges that accept 2.0 gpa, helping more students access quality education in computer science and related fields, regardless of their academic background.

Beyond computer science, degrees in related areas can open unique career pathways. For example, if you’re interested in technology’s impact on the planet, explore what paths exist and what can you do with an environmental science major. Combining computer science skills with another field can further broaden your job opportunities.

Best Scientists Citing Francesco M. Donini

Trending Scientists

Recently Published Articles