Efficiently Coupling the I-DLV Grounder with ASP Solvers
Not on the map. Why?
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).
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2021Aggregate Semantics for Propositional Answer Set Programscited by 5
- 2023An efficient solver for ASP(Q)cited by 2
- 2022On the Configuration of More and Less Expressive Logic Programscited by 1
- 2024Handling irresolvable conflicts in the Semantic Web: an RDF-based conflict-tolerant version of the Deontic Traditional Schemecited by 0
- 2025Automated Hybrid Grounding Using Structural and Data-Driven Heuristicscited by 0
- 2025Automated Hybrid Grounding Using Structural and Data-Driven Heuristics23 Jul 2025
- 2024Handling irresolvable conflicts in the Semantic Web: an RDF-based conflict-tolerant version of the Deontic Traditional Scheme29 Nov 2024
- 2023An efficient solver for ASP(Q)17 May 2023
- 2022On the Configuration of More and Less Expressive Logic Programs2 Mar 2022
- 2021Aggregate Semantics for Propositional Answer Set Programs17 Sep 2021