Luis Angel Rodriguez Reiners
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luis Angel Rodriguez Reiners has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Mario Alviano
DEMACS, University of Calabria
9 shared publications - Fabrizio Lo Scudo
University of Calabria
2 shared publications - Wolfgang Faber
University of Klagenfurt, Klagenfurt, Austria
2 shared publications Danilo Amendola
Oliveru - Smartly Engineering, Rende, Italy and Joint Research Centre, European Commission, Geel, Belgium
1 shared publication- Danilo Amendola
Joint Research Centre (JRC), European Commission, Geel, Belgium
1 shared publication - Georg Gottlob
University of Calabria
1 shared publication
Latest Publications
- 11 October 2026
- Published by Springer Nature
- p. 19-34
ASP Sous-Chef
- Open Access
- 28 September 2026
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 87
Integrating Answer Set Programming and Large Language Models for Reliable Structured Knowledge Extraction
Answer Set Programming (ASP) and Large Language Models (LLMs) offer complementary strengths in symbolic reasoning and natural language understanding. In this work, we present an integrated framework for reliable structured knowledge extraction from natural language that combines the syntactic capabilities of LLMs with the semantic constraints provided by ASP. Structured representations in the form of ASP facts are obtained by guiding LLM generation through domain specific prompt templates and background knowledge specified in a declarative YAML configuration, and by validating and completing the extracted information using an ASP knowledge base. Building on this framework, we introduce grammar constrained decoding as a principled mechanism to enforce structural and semantic alignment between LLM outputs and target symbolic representations. By leveraging formal grammars, we gain fine grained control over the generation process, substantially reducing hallucinations and limiting unnecessary verbosity, while preserving extraction quality. We study three grammar formats commonly used to represent structured knowledge, namely CSV, Datalog, and JSON, and analyze their impact on correctness, efficiency, and computational cost. We evaluate the proposed approach on benchmarks derived from ASP Competitions. The results show that the integration of ASP consistently improves extraction accuracy over vanilla LLMs, particularly for smaller models. Moreover, grammar constrained decoding maintains these gains while significantly improving generation efficiency. Among the considered formats, CSV provides the best trade-off between accuracy and cost, JSON achieves the highest extraction quality at the expense of increased verbosity, and Datalog exhibits lower robustness in the extraction process. Overall, the results demonstrate that combining ASP with grammar constrained LLM output yields a reliable, scalable, and cost-effective approach to structured knowledge extraction.
- 28 September 2026
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 87
Open AccessIntegrating Answer Set Programming and Large Language Models for Reliable Structured Knowledge Extraction
Answer Set Programming (ASP) and Large Language Models (LLMs) offer complementary strengths in symbolic reasoning and natural language understanding. In this work, we present an integrated framework for reliable structured knowledge extraction from natural language that combines the syntactic capabilities of LLMs with the semantic constraints provided by ASP. Structured representations in the form of ASP facts are obtained by guiding LLM generation through domain specific prompt templates and background knowledge specified in a declarative YAML configuration, and by validating and completing the extracted information using an ASP knowledge base. Building on this framework, we introduce grammar constrained decoding as a principled mechanism to enforce structural and semantic alignment between LLM outputs and target symbolic representations. By leveraging formal grammars, we gain fine grained control over the generation process, substantially reducing hallucinations and limiting unnecessary verbosity, while preserving extraction quality. We study three grammar formats commonly used to represent structured knowledge, namely CSV, Datalog, and JSON, and analyze their impact on correctness, efficiency, and computational cost. We evaluate the proposed approach on benchmarks derived from ASP Competitions. The results show that the integration of ASP consistently improves extraction accuracy over vanilla LLMs, particularly for smaller models. Moreover, grammar constrained decoding maintains these gains while significantly improving generation efficiency. Among the considered formats, CSV provides the best trade-off between accuracy and cost, JSON achieves the highest extraction quality at the expense of increased verbosity, and Datalog exhibits lower robustness in the extraction process. Overall, the results demonstrate that combining ASP with grammar constrained LLM output yields a reliable, scalable, and cost-effective approach to structured knowledge extraction.
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4330-4338
Integrating Answer Set Programming and Large Language Models for Enhanced Structured Representation of Complex Knowledge in Natural Language
Answer Set Programming (ASP) and Large Language Models (LLMs) have emerged as powerful tools in Artificial Intelligence, each offering unique capabilities in knowledge representation and natural language processing, respectively. In this paper, we combine the strengths of the two paradigms with the aim of improving the structured representation of complex knowledge encoded in natural language. In a nutshell, the structured representation is obtained by combining syntactic structures extracted by LLMs and semantic aspects encoded in the knowledge base. The interaction between ASP and LLMs is driven by a YAML file specifying prompt templates and domain-specific background knowledge. The proposed approach is evaluated using a set of benchmarks based on a dataset obtained from problems of ASP Competitions. The results of our experiment show that ASP can sensibly improve the F1-score, especially when relatively small models are used.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4330-4338
Open AccessIntegrating Answer Set Programming and Large Language Models for Enhanced Structured Representation of Complex Knowledge in Natural Language
Answer Set Programming (ASP) and Large Language Models (LLMs) have emerged as powerful tools in Artificial Intelligence, each offering unique capabilities in knowledge representation and natural language processing, respectively. In this paper, we combine the strengths of the two paradigms with the aim of improving the structured representation of complex knowledge encoded in natural language. In a nutshell, the structured representation is obtained by combining syntactic structures extracted by LLMs and semantic aspects encoded in the knowledge base. The interaction between ASP and LLMs is driven by a YAML file specifying prompt templates and domain-specific background knowledge. The proposed approach is evaluated using a set of benchmarks based on a dataset obtained from problems of ASP Competitions. The results of our experiment show that ASP can sensibly improve the F1-score, especially when relatively small models are used.
- Open Access
- 1 July 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (4) , 417-436
ASP Chef Grows Mustache to Look Better
We present ASP Chef Mustache, an extension of ASP Chef that enhances template-based rendering of answer set programming (ASP) solutions using a logic-less templating system inspired by Mustache. Our approach integrates data visualization frameworks such as Tabulator, Chart.js, and vis.js, enabling interactive representations of ASP interpretations as tables, charts, and graphs. Mustache queries in templates support advanced constructs for formatting, sorting, and multi-stage expansion, facilitating the generation of rich, structured outputs. We demonstrate the power of this framework through a series of use cases, including data analysis for the Italian VQR, visualization of blocking sets in graphs, and scheduling problems. The result is a versatile tool for bridging declarative problem solving and modern web-based visual analytics.
- 1 July 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (4) , 417-436
Open AccessASP Chef Grows Mustache to Look Better
We present ASP Chef Mustache, an extension of ASP Chef that enhances template-based rendering of answer set programming (ASP) solutions using a logic-less templating system inspired by Mustache. Our approach integrates data visualization frameworks such as Tabulator, Chart.js, and vis.js, enabling interactive representations of ASP interpretations as tables, charts, and graphs. Mustache queries in templates support advanced constructs for formatting, sorting, and multi-stage expansion, facilitating the generation of rich, structured outputs. We demonstrate the power of this framework through a series of use cases, including data analysis for the Italian VQR, visualization of blocking sets in graphs, and scheduling problems. The result is a versatile tool for bridging declarative problem solving and modern web-based visual analytics.
- Open Access
ASP Chef grows Mustache to look better
We present ASP Chef Mustache, an extension of ASP Chef that enhances template-based rendering of ASP solutions using a logic-less templating system inspired by Mustache. Our approach integrates data visualization frameworks such as Tabulator, Chart.js, and vis.js, enabling interactive representations of ASP interpretations as tables, charts, and graphs. Mustache queries in templates support advanced constructs for formatting, sorting, and multi-stage expansion, facilitating the generation of rich, structured outputs. We demonstrate the power of this framework through a series of use cases, including data analysis for the Italian VQR, visualization of blocking sets in graphs, and scheduling problems. The result is a versatile tool for bridging declarative problem solving and modern web-based visual analytics.
Open AccessASP Chef grows Mustache to look better
We present ASP Chef Mustache, an extension of ASP Chef that enhances template-based rendering of ASP solutions using a logic-less templating system inspired by Mustache. Our approach integrates data visualization frameworks such as Tabulator, Chart.js, and vis.js, enabling interactive representations of ASP interpretations as tables, charts, and graphs. Mustache queries in templates support advanced constructs for formatting, sorting, and multi-stage expansion, facilitating the generation of rich, structured outputs. We demonstrate the power of this framework through a series of use cases, including data analysis for the Italian VQR, visualization of blocking sets in graphs, and scheduling problems. The result is a versatile tool for bridging declarative problem solving and modern web-based visual analytics.
- Open Access
- 1 November 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 21 (1) , 720-730
ASP Chef: Draw and Expand
ASP Chef is a versatile tool built upon the principles of Answer Set Programming (ASP), offering a unique approach to problem-solving through the concept of ASP recipes. In this paper, we explore two key components of ASP Chef: the Graph ingredient and one of its extension mechanisms for registering new ingredients. The Graph ingredient serves as a fundamental feature within ASP Chef, allowing users to interpret instances of a designed predicate to construct graphs from the data. Through this capability, ASP Chef facilitates the visualization and analysis of complex relationships and structures inherent in various domains. Furthermore, ASP Chef offers a flexible extension mechanism that empowers users to register new recipes as custom ingredients. These custom ingredients, defined by sequences of mappings from interpretations to interpretations, can be stored locally within the local storage of the browser. This enables users to expand the capabilities of ASP Chef to suit their specific needs and use cases, fostering a collaborative environment where users can share and reuse custom ingredients seamlessly. Notably, the addition of new ingredients does not impose requirements on the utilization of recipes that employ them, underscoring the modular and interoperable design of ASP Chef.
- 1 November 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 21 (1) , 720-730
Open AccessASP Chef: Draw and Expand
ASP Chef is a versatile tool built upon the principles of Answer Set Programming (ASP), offering a unique approach to problem-solving through the concept of ASP recipes. In this paper, we explore two key components of ASP Chef: the Graph ingredient and one of its extension mechanisms for registering new ingredients. The Graph ingredient serves as a fundamental feature within ASP Chef, allowing users to interpret instances of a designed predicate to construct graphs from the data. Through this capability, ASP Chef facilitates the visualization and analysis of complex relationships and structures inherent in various domains. Furthermore, ASP Chef offers a flexible extension mechanism that empowers users to register new recipes as custom ingredients. These custom ingredients, defined by sequences of mappings from interpretations to interpretations, can be stored locally within the local storage of the browser. This enables users to expand the capabilities of ASP Chef to suit their specific needs and use cases, fostering a collaborative environment where users can share and reuse custom ingredients seamlessly. Notably, the addition of new ingredients does not impose requirements on the utilization of recipes that employ them, underscoring the modular and interoperable design of ASP Chef.
- 9 October 2024
- Published by Springer Nature
- p. 174-186
Integrating MiniZinc with ASP Chef: Browser-Based Constraint Programming for Education and Prototyping
- 9 October 2024
- Published by Springer Nature
- p. 174-186
Integrating MiniZinc with ASP Chef: Browser-Based Constraint Programming for Education and Prototyping
- 9 October 2024
- Published by Springer Nature
- p. 387-392
Integrating Structured Declarative Language (SDL) into ASP Chef
- 9 October 2024
- Published by Springer Nature
- p. 387-392
Integrating Structured Declarative Language (SDL) into ASP Chef
- 18 May 2024
- Published by SAGE Publications in Intelligenza Artificiale
- Vol. 18 (2) , 261-278
Addressing marketplace logistic tasks in answer set programming
Marketplaces bring together products from multiple providers and automatically manage orders that involve several suppliers. We document the use of Answer Set Programming to automatically choose products from various warehouses within a marketplace network to fulfill a specified order. The proposed solution seamlessly adapts to various objective functions utilized at different stages of order management, leading to cost savings for customers and simplifying logistics for both the marketplace and its suppliers.
- 18 May 2024
- Published by SAGE Publications in Intelligenza Artificiale
- Vol. 18 (2) , 261-278
Addressing marketplace logistic tasks in answer set programming
Marketplaces bring together products from multiple providers and automatically manage orders that involve several suppliers. We document the use of Answer Set Programming to automatically choose products from various warehouses within a marketplace network to fulfill a specified order. The proposed solution seamlessly adapts to various objective functions utilized at different stages of order management, leading to cost savings for customers and simplifying logistics for both the marketplace and its suppliers.