no code implementations • 22 Oct 2023 • Pierangela Bruno, Francesco Calimeri, Cinzia Marte, Simona Perri
Although the availability of a large amount of data is usually given for granted, there are relevant scenarios where this is not the case; for instance, in the biomedical/healthcare domain, some applications require to build huge datasets of proper images, but the acquisition of such images is often hard for different reasons (e. g., accessibility, costs, pathology-related variability), thus causing limited and usually imbalanced datasets.
1 code implementation • 5 Aug 2021 • Francesco Calimeri, Marco Manna, Elena Mastria, Maria Concetta Morelli, Simona Perri, Jessica Zangari
We introduce a novel logic-based system for reasoning over data streams, which relies on a framework enabling a tight, fine-tuned interaction between Apache Flink and the I^2-DLV system.
no code implementations • 17 Jun 2021 • Tobias Roß, Pierangela Bruno, Annika Reinke, Manuel Wiesenfarth, Lisa Koeppel, Peter M. Full, Bünyamin Pekdemir, Patrick Godau, Darya Trofimova, Fabian Isensee, Sara Moccia, Francesco Calimeri, Beat P. Müller-Stich, Annette Kopp-Schneider, Lena Maier-Hein
Challenges have become the state-of-the-art approach to benchmark image analysis algorithms in a comparative manner.
no code implementations • 22 Sep 2020 • Elena Mastria, Jessica Zangari, Simona Perri, Francesco Calimeri
In particular, given an ASP program and a set of input facts, our approach chooses whether and how to rewrite input rules based on a set of features measuring their structural properties and domain information.
1 code implementation • 11 Nov 2019 • Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea, Francesco Ricca, Torsten Schaub
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications.
no code implementations • 21 Oct 2019 • Francesco Calimeri, Francesco Cauteruccio, Luca Cinelli, Aldo Marzullo, Claudio Stamile, Giorgio Terracina, Francoise Durand-Dubief, Dominique Sappey-Marinier
The framework relies on a combined use of ML and ASP, and is general enough to be applied in several other application scenarios, which are outlined in the paper.
no code implementations • 22 Jul 2019 • Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri, Jessica Zangari
In this context, we propose an incremental grounding approach for the answer set semantics.
no code implementations • 23 Dec 2018 • Francesco Calimeri, Simona Perri, Jessica Zangari
Furthermore, we define a set of new heuristics tailored at optimizing grounding, one of the main phases of the ASP computation; we use them in order to implement the approach into the ASP system DLV, in particular into its grounding subsystem I-DLV, and carry out an extensive experimental activity for assessing the impact of the proposal.
1 code implementation • 15 Sep 2017 • Stefano Germano, Francesco Calimeri, Eliana Palermiti
Logic-based paradigms are nowadays widely used in many different fields, also thank to the availability of robust tools and systems that allow the development of real-world and industrial applications.
1 code implementation • 21 Jul 2017 • Francesco Calimeri, Davide Fuscà, Stefano Germano, Simona Perri, Jessica Zangari
Answer Set Programming (ASP) is a well-established declarative problem solving paradigm which became widely used in AI and recognized as a powerful tool for knowledge representation and reasoning (KRR), especially for its high expressiveness and the ability to deal also with incomplete knowledge.
no code implementations • 14 May 2014 • Francesco Calimeri, Martin Gebser, Marco Maratea, Francesco Ricca
Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and nonmonotonic reasoning.
no code implementations • 18 Jan 2014 • Mario Alviano, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri
As a consequence, a well-founded semantics for general LPA programs that allows for tractable computation is unlikely to exist, which justifies the restriction on LPAma programs.