Arrow Research search

Author name cluster

Simona Perri

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

8 papers
2 author rows

Possible papers

8

KR Conference 2024 Conference Paper

LLASP: Fine-tuning Large Language Models for Answer Set Programming

  • Erica Coppolillo
  • Francesco Calimeri
  • Giuseppe Manco
  • Simona Perri
  • Francesco Ricca

Recently, Large Language Models (LLMs) have showcased their potential in various natural language processing tasks, including code generation. However, while significant progress has been made in adapting LLMs to generate code for several imperative programming languages and tasks, there remains a notable gap in their application to declarative formalisms, such as Answer Set Programming (ASP). In this paper, we move a step towards exploring the capabilities of LLMs for ASP code generation. First, we perform a systematic evaluation of several state-of-the-art LLMs. Despite their power in terms of number of parameters, training data and computational resources, empirical results demonstrate inadequate performances in generating correct ASP programs. Therefore, we propose LLASP, a fine-tuned lightweight model specifically trained to encode fundamental ASP program patterns. To this aim, we create an ad-hoc dataset covering a wide variety of fundamental problem specifications that can be encoded in ASP. Our experiments demonstrate that the quality of ASP programs generated by LLASP is remarkable. This holds true not only when compared to the non-fine-tuned counterpart but also when compared to the majority of eager LLM candidates, particularly from a semantic perspective. All the code and data used to perform the experiments are publicly available: https: //github. com/EricaCoppolillo/LLASP.

ICRA Conference 2021 Conference Paper

Optimized 3D path planner for steerable catheters with deductive reasoning

  • Alice Segato
  • Valentina Corbetta
  • Jessica Zangari
  • Simona Perri
  • Francesco Calimeri
  • Elena De Momi

Keyhole neurosurgery is challenging, due to the complex anatomy of the brain and the inherent risk of damaging vital structures while reaching the surgical target. This paper presents a path planner for safe and effective neurosurgical interventions. The strengths of the proposed framework lay in the integration of multiple risk structures combined into a deductive method for fast and intuitive user interaction, and a modular architecture. The tool is intended to support neurosurgeons at quickly determining the most appropriate surgical trajectory through the brain matter with minimized risk; the user interface guides the user through the decision making process and helps save planning time of neurosurgical interventions. Risk structures and trajectories can be visualized in an intuitive way, thanks to a 3D brain surgery simulator developed with Unity. A qualitative evaluation with clinical experts shows the practical relevance, while a quantitative performance and functionality analysis proves the robustness and effectiveness of the system with respect to literature.

JELIA Conference 2019 Conference Paper

Memory-Saving Evaluation Plans for Datalog

  • Carlo Allocca
  • Roberta Costabile
  • Alessio Fiorentino
  • Simona Perri
  • Jessica Zangari

Abstract Ontology-based query answering (OBQA), without any doubt, represents one of the fundamental reasoning services in Semantic Web applications. Specifically, OBQA is the task of evaluating a (conjunctive) query over a knowledge base (KB) consisting of an extensional dataset paired with an ontology. A number of effective practical approaches proposed in the literature rewrite the query and the ontology into an equivalent Datalog program. In case of very large datasets, however, classical approaches for evaluating such programs tend to be memory consuming, and may even slow down the computation. In this paper, we explain how to compute a memory-saving evaluation plan consisting of an optimal indexing schema for the dataset together with a suitable body-ordering for each Datalog rule. To evaluate the quality of our approach, we compare our plans with the classical approach used by DLV over widely used ontological benchmarks. The results confirm the memory usage can be significantly reduced without paying any cost in efficiency.

IJCAI Conference 2018 Conference Paper

Evaluation Techniques and Systems for Answer Set Programming: a Survey

  • Martin Gebser
  • Nicola Leone
  • Marco Maratea
  • Simona Perri
  • Francesco Ricca
  • Torsten Schaub

Answer set programming (ASP) is a prominent knowledge representation and reasoning paradigm that found both industrial and scientific applications. The success of ASP is due to the combination of two factors: a rich modeling language and the availability of efficient ASP implementations. In this paper we trace the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools.

NMR Workshop 2004 Conference Paper

BackJumping techniques for rules instantiation in the DLV system

  • Nicola Leone
  • Simona Perri
  • Francesco Scarcello

The computation of the answer sets in Answer Set Programming (ASP) ASP systems is performed on simple ground (i. e. , variable free) programs, first computed by a pre-processing phase, called instantiation. This phase may be computationally expensive, and in fact it has been recognized to be a key issue for solving real-world problems by using Answer Set Programming. Given a program P, a good instantiation for P is a ground program P 0 having precisely the same answer sets as P and such that: (i) P 0 can be computed efficiently from P, and (ii) P 0 does not contain “useless” rules, (P 0 is as small as possible) and can be thus evaluated efficiently. In this paper, we present a structure-based backjumping algorithm for the instantiation of logic programs, that meets the above requirements. In particular, given a rule r to be grounded, our algorithm exploits both the semantical and the structural information about r for computing efficiently the ground instances of r, avoiding the generation of “useless” rules. That is, from each general rule r, we are able to compute only a relevant subset of all its possible ground instances. We have implemented this algorithm in the ASP system DLV, and we have carried out an experimentation activity on a collection of benchmark problems. The results are very positive, as the new technique improves sensibly the efficiency of the DLV system on many kind of programs.

JELIA Conference 2004 Conference Paper

New DLV Features for Data Integration

  • Francesco Calimeri
  • Manuela Citrigno
  • Chiara Cumbo
  • Wolfgang Faber 0001
  • Nicola Leone
  • Simona Perri
  • Gerald Pfeifer

Abstract The DLV system is currently employed in projects on data integration – a challenging application area for Answer Set Programming. The present system description illustrates some new optimization techniques, which significantly enhance the general performance of DLV, and especially in the context of data integration.

JELIA Conference 2002 Conference Paper

The DLV System

  • Nicola Leone
  • Gerald Pfeifer
  • Wolfgang Faber 0001
  • Francesco Calimeri
  • Tina Dell'Armi
  • Thomas Eiter
  • Georg Gottlob
  • Giovambattista Ianni

Abstract The development of the DLV system has started as a research projectfinanced by FWF (the Austrian Science Funds) in 1996, and has evolved into an international collaboration over the years. Currently, the University of Calabria and TU Wien participate in the project, supported by a scientific-technological collaboration between Italy and Austria. At the time of writing, the latest version of the system has been released on April 12, 2002.

LPAR Conference 2001 Conference Paper

Census Data Repair: a Challenging Application of Disjunctive Logic Programming

  • Enrico Franconi
  • Antonio Laureti Palma
  • Nicola Leone
  • Simona Perri
  • Francesco Scarcello

Abstract Census data provide valuable insights on the economic, social and demographic conditions and trends occurring in a country. Census data is collected by means of millions of questionnaires, each one including the details of the persons living together in the same house. Before the data from the questionnaires is sent to the statisticians to be analysed, a cleaning phase (called “imputation”) is performed, in order to eliminate consistency problems, missing answers, or errors. It is important that the imputation step is done without altering the statistical validity of the collected data. The contribution of this paper is two fold. On the one hand, it provides a clear and well-founded declarative semantics to questionnaires and to the imputation problem. On the other hand, a correct modular encoding of the problem in the disjunctive logic programming language DLP (suw), supported by the DLV system, is shown. It turns out that DLP (suw) is very well-suited for this goal. Census data repair appears to be a challenging application area for disjunctive logic programming.

v2026.09.13