请输入您要查询的百科知识:

 

词条 Draft:Nicola Leone
释义

  1. Career and Research

  2. Awards and honours

  3. References

{{AFC submission|d|ilc|u=5.90.96.72|ns=118|decliner=Whispering|declinets=20181106190826|reason2=bio|ts=20181106161049}} Nicola Leone is an Italian computer scientist who works in the areas of artificial intelligence, knowledge representation and reasoning, and database theory.[1][2][3][4][5][6][7][8][9]

Career and Research

He is currently a professor of Computer Science at the University of Calabria,[10] and the chair of the PhD programme in Mathematics and Computer Science.[11] Previously, he was a professor of Database Systems at the TU Wien.[12][4]

He has published more than 250 scientific articles in the areas of artificial intelligence, knowledge representation and reasoning, and database theory.[1][2][3]

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)[6][13][14][15]

and for the development of DLV,[7] 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.[7]

To the field of database theory he mainly contributed through the invention of hypertree decomposition,[8][9] 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[16].

Awards and honours

He is a fellow of the European Coordinating Committee for Artificial Intelligence (EurAI),[17] ″being recognised as a European AI researcher who has made exceptional contributions to the field″.[18]

He is also included in the list of the Top Italian Scientists of the Via Academy,[19] comprising the most cited Italian scientists from all disciplines.

He won many Best-Paper award in logic programming conferences,[20][21] and he was awarded two Test-of-Time Awards, by the Association for Computing Machinery (ACM) (2009),[22] and by the Association for Logic Programming (2018),[23] these prizes are granted to the most influential paper from the proceedings of the main conference of the association of ten years prior.[24]

References

1. ^{{Cite web|url=https://scholar.google.com/citations?user=CfWxOHAAAAAJ&hl=en|title=Nicola Leone – Google Scholar Citations|website=scholar.google.com}}
2. ^{{Cite web|url=https://dblp.uni-trier.de/pers/hd/l/Leone:Nicola|title=dblp: Nicola Leone|website=dblp.uni-trier.de}}
3. ^{{Cite web|url=https://www.scopus.com/authid/detail.uri?origin=AuthorProfile&authorId=7004438804&zone=|title=Scopus preview – Scopus – Author details (Leone, Nicola)|website=www.scopus.com}}
4. ^{{Cite web|url=https://orcid.org/0000-0002-9742-1252|title=ORCID|website=orcid.org}}
5. ^{{Cite journal | doi = 10.1145/382780.382783| title = The Complexity of Acyclic Conjunctive Queries| journal = Journal of the ACM| volume = 48| issue = 3| pages = 431–498| year = 2001| last1 = Gottlob | first1 = G. | last2 = Leone | first2 = N. | last3 = Scarcello | first3 = F.}}
6. ^{{Cite journal | doi = 10.1016/S0004-3702(03)00078-X| title = Enhancing disjunctive logic programming systems by SAT checkers| journal = Artificial Intelligence| volume = 151| issue = 1–2| pages = 177–212| year = 2003| last1 = Koch | first1 = C. | last2 = Leone | first2 = N. | last3 = Pfeifer | first3 = G.}}
7. ^{{Cite journal | doi = 10.1145/1149114.1149117 | title = The DLV system for knowledge representation and reasoning | journal = ACM Transactions on Computational Logic (TOCL) | volume = 7 | issue = 3 | pages = 499–562 | year = 2006 | last1 = Leone | first1 = N. | last2 = Pfeifer | first2 = G. | last3 = Faber | first3 = W. | last4 = Gottlob | first4 = G. | last5 = Perri | first5 = S. | last6 = Scarcello | first6 = F.}}
8. ^{{Cite journal | doi = 10.1006/jcss.2001.1809| title = Hypertree Decompositions and Tractable Queries| journal = Journal of Computer and System Sciences| volume = 64| issue = 3| pages = 579| year = 2002| last1 = Gottlob | first1 = G. | last2 = Leone | first2 = N. | last3 = Scarcello | first3 = F.}}
9. ^{{Cite web|url=http://www.researchitaly.it/en/success-stories/calabria-confirms-its-contribution-to-computer-science/|title=Calabria confirms its contribution to computer science|website=ResearchItaly – Calabria confirms its contribution to computer science}}
10. ^{{Cite web|url=https://www.mat.unical.it/ComputerScience/LEONE|title=LEONE – ComputerScience|website=www.mat.unical.it}}
11. ^{{Cite web|url=https://www.mat.unical.it/phd/Coordinator|title=Coordinator – Ph.D. in Mathematics and Computer Science|website=www.mat.unical.it}}
12. ^{{Cite web|url=https://www.dbai.tuwien.ac.at/staff/leone/|title=DBAI -- Prof. Nicola Leone|website=www.dbai.tuwien.ac.at}}
13. ^{{Cite journal | doi = 10.1109/69.877512| title = Enhancing Disjunctive Datalog by Constraints| journal = IEEE Transactions on Knowledge and Data Engineering| volume = 12| issue = 5| pages = 845–860| year = 2000| last1 = Buccafurri | first1 = F. | last2 = Leone | first2 = N. | last3 = Rullo | first3 = P.}}
14. ^{{Cite journal | doi = 10.1016/j.artint.2010.04.002| title = Semantics and complexity of recursive aggregates in answer set programming| journal = Artificial Intelligence| volume = 175| issue = 1| pages = 278–298| year = 2011| last1 = Faber | first1 = W. | last2 = Pfeifer | first2 = G. | last3 = Leone | first3 = N.}}
15. ^{{Cite journal | doi = 10.1006/inco.1997.2630| title = Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation| journal = Information and Computation| volume = 135| issue = 2| pages = 69–112| year = 1997| last1 = Leone | first1 = N. | last2 = Rullo | first2 = P. | last3 = Scarcello | first3 = F.}}
16. ^{{Cite journal | doi = 10.1006/jcss.2000.1713| title = Conjunctive-Query Containment and Constraint Satisfaction| journal = Journal of Computer and System Sciences| volume = 61| issue = 2| pages = 302-332| year = 2000| last1 = Kolaitis | first1 = P.G. | last2 = Vardi | first2 = M.Y.}}
17. ^{{Cite web|url=https://www.eurai.org/awards_and_grants/fellows|title=Fellows | European Association for Artificial Intelligence|website=www.eurai.org}}
18. ^{{Cite web|url=https://www.eurai.org/apply_for/fellow_program|title=Fellow Program | European Association for Artificial Intelligence|website=www.eurai.org}}
19. ^{{Cite web|url=http://www.topitalianscientists.org/TIS_HTML/Top_Italian_Scientists_Computer_Sciences.htm|title=Top Italian Scientists Computer Sciences|website=www.topitalianscientists.org}}
20. ^{{Cite web|url=http://www.researchitaly.it/en/success-stories/researchers-at-the-university-of-calabria-awarded-the-prize-for-best-research-on-logic-programming/|title=Researchers at the University of Calabria awarded the prize for best research on Logic Programming|website=ResearchItaly – Researchers at the University of Calabria awarded the prize for best research on Logic Programming}}
21. ^{{Cite web|url=http://www.researchitaly.it/en/success-stories/university-of-calabria-wins-once-again-with-artificial-intelligence/|title=University of Calabria wins once again with Artificial Intelligence|website=ResearchItaly – University of Calabria wins once again with Artificial Intelligence}}
22. ^{{Cite web|url=https://sigmod.org/pods/acm-pods-alberto-o-mendelzon-test-of-time-award/|title=ACM PODS Alberto O. Mendelzon Test-of-Time Award – SIGMOD Website}}
23. ^{{Cite web|url=https://www.cs.nmsu.edu/ALP/2018/08/iclp-2018-conference-report/|title=ICLP 2018: Conference Report – Association for Logic Programming|first=Enrico|last=Pontelli}}
24. ^{{Cite web|url=https://www.mat.unical.it/phd/Awards#A2018|title=Awards – Ph.D. in Mathematics and Computer Science|website=www.mat.unical.it}}
{{AFC submission|||ts=20190211142609|u=2.225.7.80|ns=118}}
随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/23 20:24:56