Efficiently Coupling the I-DLV Grounder with ASP Solvers
Francesco Calimeri, Carmine Dodaro, Davide Fusc\`a, Simona Perri,, Jessica Zangari

TL;DR
The paper introduces I-DLV+MS, an ASP system that combines an efficient grounder with machine learning-based solver selection, leading to winning performance in ASP competitions.
Contribution
It presents a novel integration of a grounder with an automatic, ML-guided solver selector for ASP, improving efficiency and competitiveness.
Findings
Won the 7th ASP competition in the regular track.
Successfully integrated machine learning for solver selection.
Demonstrated improved performance over existing systems.
Abstract
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: depending on some inherent features of the instantiation produced by I-DLV, machine learning techniques guide the selection of the most appropriate solver. The system participated in the latest (7th) ASP competition, winning the regular track, category SP (i.e., one processor allowed). Under consideration in Theory and Practice of Logic Programming (TPLP).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
