Nicola Leone - Selected Publications#

1. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, F. Scarcello. The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic, ACM Press, 7(3), July 2006. pp. 499–562.

[This paper has been cited more than 1,200 times and has the highest citation count of all papers published in the journal ACM Transactions on Computational Logic since the first issue.]

2. N. Leone, M. Manna, G. Terracina, P. Veltri. Fast Query Answering over Existential Rules, ACM Transactions on Computational Logic, ACM Press. 20(2), March 2019.

3. G. Amendola, N. Leone, M. Manna, Finite Model Reasoning over Existential Rules. Theory and Practice of Logic Programming, 2017, Cambridge university press, Vol. 17, issue 5-6, September 2017. pp. 726-743.

Winner of the Best Student-Paper Award ICLP 2017, Melbourne, Australia, August 2017.

4. M. Alviano, N. Leone. Complexity and compilation of gz-aggregates in answer set programming. Theory and Practice of Logic Programming, 2015, Cambridge university press, volume 15, issue 4-5, pp. 574-587, 2015.

Winner of the Best Paper Award ICLP 2015, Cork, Ireland, August 2015.

5. G. Amendola, T. Eiter, N. Leone, J. Moura. Semi-Equilibrium Models for Paracoherent Answer Set Programs. Artificial Intelligence, Elsevier, volume 234, pp. 219–271, 2016.

6. M. Alviano, G. Greco, W.Faber, N. Leone, Magic Sets for disjunctive Datalog programs. Artificial Intelligence, Elsevier, Volumes 187-188, Pages 156-192, August 2012.

7. M. Alviano, F. Calimeri, W. Faber, N. Leone, S. Perri. Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates. Journal of Artificial Intelligence Research, Elsevier, Vol. 42, pp. 487–527, November 2011.

8. F. Calimeri, S. Cozza, G. Ianni, N. Leone. Computable Functions in ASP: Theory and Implementation. Proceedings of the 24th International Conference on Logic Programming – ICLP’08, Lecture Notes in Computer Science, Springer-Verlag, Vol. 5366, December 9–13, 2008, Udine, Italy. pp. 407–424.

Winner of the ICLP 2018 Test-of-Time Award, Oxford, UK, July 2018.

9. G. Gottlob, N. Leone, and F. Scarcello. The Complexity of Acyclic Conjunctive Queries, Journal of the ACM, 48(3), pp. 431–498, May 2001.

10. G. Gottlob, N. Leone, F. Scarcello, Hypertree Decompositions and Tractable Queries, Journal of Computer and System Sciences, Elsevier, 64(3): 579-627, 2002.

Preliminary version in Proceedings of the 18th ACM Symposium on Principles of Database Systems – PODS’99, ACM-Press, Philadelphia, 1999, pp. 21–32. Winner of the 2009 ACM PODS Alberto O. Mendelzon Test-of-Time Award, June 2009.

BIBLIOMETRICS

10,700 Citations, H-index 54 (Google Scholar)