Technical note. Efficiently coupling the I-DLV grounder with ASP solvers

From MaRDI portal
Publication:4957193

DOI10.1017/S1471068418000546zbMATH Open1472.68179arXiv1810.00041OpenAlexW2893932668MaRDI QIDQ4957193FDOQ4957193


Authors: Francesco Calimeri, Carmine Dodaro, Davide Fuscà, Simona Perri, Jessica Zangari Edit this on Wikidata


Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1810.00041




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957193)