# Efficiently Coupling the I-DLV Grounder with ASP Solvers

arXiv: https://arxiv.org/abs/1810.00041 · HTML: https://mlsanity.com/paper/1810.00041/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Sep 2018.

## Built on by (most cited first, 5 of 5)

- [Aggregate Semantics for Propositional Answer Set Programs](https://mlsanity.com/paper/2109.08662/) (2021)
- [An efficient solver for ASP(Q)](https://mlsanity.com/paper/2305.10021/) (2023)
- [On the Configuration of More and Less Expressive Logic Programs](https://mlsanity.com/paper/2203.01024/) (2022)
- [Handling irresolvable conflicts in the Semantic Web: an RDF-based conflict-tolerant version of the Deontic Traditional Scheme](https://mlsanity.com/paper/2411.19918/) (2024)
- [Automated Hybrid Grounding Using Structural and Data-Driven Heuristics](https://mlsanity.com/paper/2507.17493/) (2025)

## Abstract (arXiv)

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).