To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

Nicola Leone
Born28 February 1963
NationalityItalian
Alma materUniversity of Calabria
Awards
Scientific career
FieldsArtificial intelligence, knowledge representation and reasoning, and database theory
InstitutionsUniversity of Calabria
TU Wien
Websitemat.unical.it/leone/wiki/HomePage

Nicola Leone is an Italian computer scientist who works in the areas of artificial intelligence, knowledge representation and reasoning, and database theory.[1] Leone is currently the rector of the University of Calabria and a professor of Computer Science.[2][3] Previously, he was a professor of Database Systems at the TU Wien.[4]

Research work

Leone has published more than 250 scientific articles in the areas of artificial intelligence, knowledge representation and reasoning, and database theory.[5]

In the area of artificial intelligence and knowledge representation and reasoning, he is best known for his influential early work on answer set programming (ASP) and for the development of DLV, a pioneering system for knowledge representation and reasoning, which was the very first successful attempt to fully support disjunction in the datalog language, achieving the possibility to compute problems of high complexity, up to NP.

To the field of database theory he mainly contributed through the invention of hypertree decomposition, a framework for obtaining tractable structural classes of conjunctive queries, and a generalisation of the notion of tree decomposition from graph theory. This work has also had substantial impact in artificial intelligence, since it is known that the problem of evaluating conjunctive queries on relational databases is equivalent to the constraint satisfaction problem[6]

Awards and honours

References

  1. ^ ""Siamo i campioni dell'informatica". Benvenuti al Mit. Anzi, a Cosenza". la Repubblica. 28 May 2019.
  2. ^ "Nicola Leone nuovo rettore Unical". Agenzia Nazionale Stampa Associata. 3 July 2019.
  3. ^ "Rende, Nicola Leone è il nuovo rettore dell'Unical". il Quotidiano del Sud.
  4. ^ "DBAI -- Prof. Nicola Leone". TU Wien.
  5. ^ "Università della Calabria, il più grande campus d'Italia alla prova del post Covid". la Repubblica (in Italian). 3 August 2020.
  6. ^ Kolaitis, P.G.; Vardi, M.Y. (2000). "Conjunctive-Query Containment and Constraint Satisfaction". Journal of Computer and System Sciences. 61 (2): 302–332. doi:10.1006/jcss.2000.1713.
  7. ^ "Fellows". European Association for Artificial Intelligence.
  8. ^ "Academia Europaea". Academia Europaea.
  9. ^ "Carlo Ghezzi and Nicola Leone received Academic Commendation". TU Wien.
  10. ^ "Researchers at the University of Calabria awarded the prize for best research on Logic Programming". ResearchItaly.
  11. ^ "University of Calabria wins once again with Artificial Intelligence". ResearchItaly.
  12. ^ "ACM PODS Alberto O. Mendelzon Test-of-Time Award". SIGMOD.
  13. ^ Pontelli, Enrico. "ICLP 2018: Conference Report – Association for Logic Programming". New Mexico State University.

External links

This page was last edited on 8 May 2024, at 01:55
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.