Nicola Leone

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${\displaystyle ^{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]

• Fellow of the European Coordinating Committee for Artificial Intelligence (EurAI).[7]
• Member of the Academia Europaea.[8]
• Honorary professor at the TU Wien.[9]
• He won many Best-Paper award in logic programming conferences,[10][11] and he was awarded two Test-of-Time Awards, by the Association for Computing Machinery (ACM) (2009),[12] and by the Association for Logic Programming (2018).[13]

• Nicola Leone publications indexed by Google Scholar