17 citations · 17 across the 1 of their papers we have counts for
3 papers
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…