Federico Igne
See Also:
Interests
Throughout my academic career I worked in the area of Knowledge Representation and Keasoning (KRR) and more in general Artificial Intelligence.
During my DPhil, my research focused on conjunctive query (CQ) answering over unrestricted ontologies. This lead to the design of novel algorithms to answer CQs via approximation techniques and the development of two tools:
- RSAComb, an efficient implementation of the combined approach algorithm for RSA, first introduced by Cristina Feier et a. (2015), and reorganized to fit the new implementation design and the integration of RDFox as a backend reasoner.
- ACQuA, a reference implementation of the hybrid architecture proposed in my final dissertation, combining RSAComb, PAGOdA, and HermiT to provide a "pay-as-you-go" CQ answering service for OWL.
Biography
I obtained my master's degree in Computer Science at the University of Udine and in collaboration with the New Mexico State University in 2017 under the supervision of Prof. Agostino Dovier and Prof. Enrico Pontelli. During that time, I worked on a distributed ASP solver using the MapReduce paradigm.
During my time at the University of Udine, I received a scholarship from the Scuola Superiore of Udine, an institution of higher education within the University of Udine.
In 2022 I completed my DPhil in Computer Science at the University of Oxford under the supervision of Prof. Ian Horrocks and Dr Stefano Germano, as part of the KRR group and in collaboration with the SIRIUS research centre at the University of Olso.
I'm also a member and IT officer of the OxRAM society for robotics and 3D printing.
I tend to spend my free time reading, tinkering and coding.
I'm passionate about free and open source software, a small, sustainable and decentralised web, electronics and embedded systems, tech education and art in all its forms.
Selected Publications
-
Conjunctive Query answering over unrestricted OWL 2 ontologies
Federico Igne
PhD Thesis University of Oxford. Oxford‚ Oxfordshire‚ UK. August, 2022.
Details about Conjunctive Query answering over unrestricted OWL 2 ontologies | BibTeX data for Conjunctive Query answering over unrestricted OWL 2 ontologies
-
RSAComb: Combined Approach for CQ Answering in RSA
Federico Igne‚ Stefano Germano and Ian Horrocks
In Martin Homola‚ Vladislav Ryzhikov and Renate A. Schmidt, editors, Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021)‚ Bratislava‚ Slovakia‚ September 19th to 22nd‚ 2021. Vol. 2954 of CEUR Workshop Proceedings. CEUR−WS.org. 2021.
Details about RSAComb: Combined Approach for CQ Answering in RSA | BibTeX data for RSAComb: Combined Approach for CQ Answering in RSA | Download (pdf) of RSAComb: Combined Approach for CQ Answering in RSA
-
Computing CQ lower−bounds over OWL 2 through approximation to RSA − Extended Abstract
Federico Igne‚ Stefano Germano and Ian Horrocks
In Oshani Seneviratne‚ Catia Pesquita‚ Juan Sequeda and Lorena Etcheverry, editors, Proceedings of the ISWC 2021 Posters‚ Demos and Industry Tracks: From Novel Ideas to Industrial Practice co−located with 20th International Semantic Web Conference (ISWC 2021)‚ Virtual Conference‚ October 24−28‚ 2021. Vol. 2980 of CEUR Workshop Proceedings. CEUR−WS.org. 2021.
Details about Computing CQ lower−bounds over OWL 2 through approximation to RSA − Extended Abstract | BibTeX data for Computing CQ lower−bounds over OWL 2 through approximation to RSA − Extended Abstract | Download (pdf) of Computing CQ lower−bounds over OWL 2 through approximation to RSA − Extended Abstract