19 citations · 64 across the 12 of their papers we have counts for
13 papers
ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding
Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza +2
DLV2 is an AI tool for Knowledge Representation and Reasoning which supports Answer Set Programming (ASP) - a logic-based declarative formalism, successfully used in both academic…
Extending Answer Set Programming with Rational Numbers
Francesco Pacenza, Jessica Zangari
Answer Set Programming (ASP) is a widely used declarative programming paradigm that has shown great potential in solving complex computational problems. However, the inability to n…
Rethinking Answer Set Programming Templates
Mario Alviano, Giovambattista Ianni, Francesco Pacenza +1
In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of i…
I-DLV-sr: A Stream Reasoning System based on I-DLV
Francesco Calimeri, Marco Manna, Elena Mastria +3
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 s…
A Machine Learning guided Rewriting Approach for ASP Logic Programs
Elena Mastria, Jessica Zangari, Simona Perri +1
Answer Set Programming (ASP) is a declarative logic formalism that allows to encode computational problems via logic programs. Despite the declarative nature of the formalism, some…
Incremental maintenance of overgrounded logic programs with tailored simplifications
Giovambattista Ianni, Francesco Pacenza, Jessica Zangari
The repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such conte…
DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries
Alessio Fiorentino, Jessica Zangari, Marco Manna
The W3C Web Ontology Language (OWL) is a powerful knowledge representation formalism at the basis of many semantic-centric applications. Since its unrestricted usage makes reasonin…
Precomputing Datalog evaluation plans in large-scale scenarios
Alessio Fiorentino, Nicola Leone, Marco Manna +2
With the more and more growing demand for semantic Web services over large databases, an efficient evaluation of Datalog queries is arousing a renewed interest among researchers an…
Incremental Answer Set Programming with Overgrounding
Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza +2
Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding…
Enhancing magic sets with an application to ontological reasoning
Mario Alviano, Nicola Leone, Pierfrancesco Veltri +1
Magic sets are a Datalog to Datalog rewriting technique to optimize query answering. The rewritten program focuses on a portion of the stable model(s) of the input program which is…
Optimizing Answer Set Computation via Heuristic-Based Decomposition
Francesco Calimeri, Simona Perri, Jessica Zangari
Answer Set Programming (ASP) is a purely declarative formalism developed in the field of logic programming and nonmonotonic reasoning: computational problems are encoded by logic p…
Efficiently Coupling the I-DLV Grounder with ASP Solvers
Francesco Calimeri, Carmine Dodaro, Davide Fuscà +2
We present I-DLV+MS , a new Answer Set Programming (ASP) system that integrates an efficient grounder, namely I-DLV, with an automatic selector that inductively chooses a solver: d…
A Framework for Easing the Development of Applications Embedding Answer Set Programming
Francesco Calimeri, Davide Fuscà, Stefano Germano +2
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 representatio…