News Biography Contacts Teaching Research Awards Publications

News

copertina libro

 


Biography

Giovanni Amendola è nato a Paola (Cosenza) il 19 luglio 1983. Ha conseguito presso l’Università della Calabria la laurea triennale in matematica nel 2005 (con lode), la laurea magistrale in matematica nel 2013 (con lode e menzione di merito) e il dottorato di ricerca in matematica ed informatica nel 2017. Nel 2017 ha lavorato come research associate presso il Laboratory for Foundations of Computer Science dell’Università di Edimburgo. Attualmente è assegnista di ricerca presso il Dipartimento di Matematica e Informatica dell’Università della Calabria, dove è stato docente per gli insegnamenti di Fondamenti di informatica, Programmazione ad oggetti, Calcolo delle probabilità e statistica e Matematica per l’analisi dei dati. La sua ricerca verte principalmente sull’intelligenza artificiale basata sulla logica matematica. Due dei suoi articoli di ricerca sono stati premiati con il Best paper award (nel 2017 e nel 2019) alla International Conference on Logic Programming. È abilitato come professore di seconda fascia nei settori concorsuali 01/B1 di Informatica (dal 14 gennaio 2020) e 01/A1 di Logica matematica e matematiche complementari (dall'8 luglio 2020). Inoltre ha conseguito con lode il baccalaureato e la licenza in teologia presso l’Istituto Teologico Calabro e il dottorato in teologia presso la Pontificia Università Lateranense (summa cum laude), occupandosi di tematiche di teologia fondamentale e del rapporto tra scienze, filosofia e teologia. Per le Edizioni Studium ha pubblicato il volume interdisciplinare Antropo-Logos. La ragione al crocevia di intelligenza artificiale, razionalità scientifica, pensiero filosofico e teologia cristiana.

 


Contacts

 


Teaching

Anno Accademico 2021/2022

Anno Accademico 2020/2021

 


Research interests

 


Awards

 


Publications

Articoli su riviste

  1. Amendola G., Dodaro C., Faber W., Ricca F. Paracoherent Answer Set Computation. Artificial Intelligence, 299, 2021.
  2. Amendola G., Ricca F., Truszczynski M. New models for generating hard random boolean formulas and disjunctive logic programs. Artificial Intelligence, 279, 2020. (See here for the arXiv version).
  3. Amendola G., Ricca F., Truszczynski M. Beyond NP: Quantifying over Answer Sets. Theory and Practice of Logic Programming, 19:705-721, 2019. (See here for the arXiv version).
  4. Amendola G., Ricca F. Paracoherent Answer Set Semantics meets Argumentation Frameworks. Theory and Practice of Logic Programming, 19:688-704, 2019. (See here for the arXiv version).
  5. Amendola G., Dodaro C., Maratea M. Abstract Solvers for Computing Cautious Consequences of ASP programs. Theory and Practice of Logic Programming, 19:740-756, 2019. (See here for the arXiv version).
  6. Amendola G., Dodaro C., Ricca F. Better Paracoherent Answer Sets with Less Resources. Theory and Practice of Logic Programming, 19:757-772, 2019. (See here for the arXiv version).
  7. Amendola G., Leone N., Manna M. Finite Model Reasoning over Existential Rules. Theory and Practice of Logic Programming, 17:726-743, 2017. (See here for the arXiv version).
  8. Amendola G., Eiter T., Fink M., Leone N., Moura J. Semi-equilibrium models for paracoherent answer set programs. Artificial Intelligence, 234:219-271, 2016.

Contributi in Conferenze e Workshops

  1. Amendola G., Berei T., Ricca F. Testing in ASP: Revisited Language and Programming Environment. In Proceedings of the 17th European Conference on Logics in Artificial Intelligence, JELIA 2021, Virtual Event, May 17-20, 2021, pages 362-376, 2021.
  2. Amendola G., Dodaro C., Maratea M. A Formal Approach for Cautious Reasoning in Answer Set Programming. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pages 4716-4720, 2020.
  3. Alviano M., Amendola G., Dodaro C., Leone N., Maratea M., Ricca F. Evaluation of disjunctive programs in WASP. In Proceedings of the 15th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2019, Philadelphia, USA June 3-7, 2019, pages 241-255, 2019.
  4. Amendola G., Marte C. Extending Bell Numbers for Parsimonious Chase Estimation. In Proceedings of the 16th European Conference on Logics in Artificial Intelligence, JELIA 2019, Cosenza, Italy, May 8-10, 2019, pages 490-497, 2019.
  5. Amendola G., Dodaro C., Faber W., Pulina L., Ricca F. Algorithm Selection for Paracoherent Answer Set Computation. In Proceedings of the 16th European Conference on Logics in Artificial Intelligence, JELIA 2019, Cosenza, Italy, May 8-10, 2019, pages 479-489, 2019.
  6. Amendola G. Solving the Stable Roommates Problem using Incoherent Answer Set Programs. In Proceedings of the RiCeRcA Workshop co-located with the 17th International Conference of the Italian Association for Artificial Intelligence, RiCeRcA@Ai*iA 2018, Trento, Italy, November 22, 2018, volume 2272 of CEUR Workshop Proceeding, 2018.
  7. Amendola G. Preliminary Results on Modeling Interdependent Scheduling Games via Answer Set Programming. In Proceedings of the RiCeRcA Workshop co-located with the 17th International Conference of the Italian Association for Artificial Intelligence, RiCeRcA@Ai*iA 2018, Trento, Italy, November 22, 2018, volume 2272 of CEUR Workshop Proceeding, 2018.
  8. Amendola G. Towards Quantified Answer Set Programming. In Proceedings of the Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion co-located with the Federated Logic Conference, RCRA@FLOC 2018, Oxford, United Kingdom, July 13, 2018, volume 2271 of CEUR Workshop Proceeding, 2018.
  9. Amendola G., Ricca F., Truszczynski M. A generator of hard 2QBF formulas and ASP programs. In Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning, KR 2018, Tempe, Arizona, 30 October-2 November, 2018, 2018.
  10. Amendola G., Ricca F., Truszczynski M. Random Models of Very Hard 2QBF and Disjunctive Programs: An Overview. In Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, 18-20 September 2018, volume 2243, 2018.
  11. Amendola G., Libkin L. Explainable Certain Answers. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, July 13-19, 2018, pages 1683-1690, 2018.
  12. Amendola G., Leone N., Manna M., Veltri P. Enhancing Existential Rules by Closed-World Variables. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, July 13-19, 2018, pages 1676-1682, 2018.
  13. Amendola G., Leone N., Manna M. Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, July 13-19, 2018, pages 5189-5192, 2018.
  14. Amendola G., Dodaro C., Faber W., Ricca F. Externally supported models for efficient computation of paracoherent answer sets. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, AAAI 2018, New Orleans, Louisiana, USA, February 2-7, 2018.
  15. Amendola G., Leone N., Manna M., Veltri P. Reasoning on anonymity in Datalog+/-. In Proceedings of the 33rd International Conference on Logic Programming, ICLP 2017, Melbourne, Australia, August 28-September 1, 2017, pages 3:1-3:5, 2017.
  16. Adrian W., Manna M., Leone N., Amendola G., Adrian M. Entity set expansion from the Web via ASP. In Proceedings of the 33rd International Conference on Logic Programming, ICLP 2017, Melbourne, Australia, August 28-September 1, 2017, pages 1:1-1:5, 2017.
  17. Amendola G., Ricca F., Truszczynski M. Generating Hard Random Boolean Formulas and Disjunctive Logic Programs. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 532-538, 2017.
  18. Amendola G., Leone N., Manna M. Querying finite or arbitrary models? No matter! Existential rules may rely on both once again. In Proceedings of the Twenty-Fifth Italian Symposium on Advanced Database Systems, SEBD 2017, Squillace Lido, Catanzaro, Italy, June 25-29, 2017.
  19. Alviano M., Amendola G., Peñaloza R. Minimal undefinedness for fuzzy answer sets. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, California, USA, February 4-9, 2017, pages 3694-3700, 2017.
  20. Amendola G., Dodaro C., Faber W., Leone N., Ricca F. On the computation of paracoherent answer sets. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, California, USA, February 4-9, 2017, pages 1034-1040, 2017.
  21. Amendola G., Greco G., Leone N., and Veltri P. Modeling and reasoning about NTU games via answer set programming. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, July 9-15, 2016, pages 38–45, 2016.
  22. Amendola G., Dodaro C., Ricca F. ASPQ: an ASP-based 2QBF solver. In Proceedings of the 4th International Workshop on Quantified Boolean Formulas, QBF 2016, Bordeaux, France, July 4, 2016, pages 49–54, 2016.
  23. Amendola G., Dodaro C., Leone N., Ricca F. On the application of answer set programming to the conference paper assignment problem. In Proceedings of the Advances in Artificial Intelligence - XVth International Conference of the Italian Association for Artificial Intelligence, AI*IA 2016, Genova, Italy, November 28-December 1, 2016, pages 164–178, 2016.
  24. Amendola G. Dealing with incoherence in ASP: Split Semi-Equilibrium Semantics. In Proceeding of the Second Doctoral Workshop in Artificial Intelligence, DWAI@AI*IA 2014, Pisa, Italy, December 11, 2014, volume 1334 of CEUR Workshop Proceeding, pages 23–32, 2014.
  25. Amendola G., Eiter T., Leone N. Modular paracoherent answer sets. In Proceedings of Logics in Artificial Intelligence - 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014, pages 457–471, 2014.
See also DBLP (a computer science bibliography), Google Scholar, ORCID, and Scopus.