19 citations · 64 across the 12 of their papers we have counts for
4 papers · 1 filter
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…