Efficiently Coupling the I-DLV Grounder with ASP Solvers
From MaRDI portal
Publication:4957193
DOI10.1017/S1471068418000546zbMATH Open1472.68179arXiv1810.00041OpenAlexW2893932668MaRDI QIDQ4957193
Carmine Dodaro, Simona Perri, Jessica Zangari, Davide Fuscà, Francesco Calimeri
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GASP: Answer Set Programming with Lazy Grounding
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Advances in WASP
- The ASP system DLV2
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Random forests
- Extending and implementing the stable model semantics
- The DLV system for knowledge representation and reasoning
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Conflict-driven answer set solving: from theory to practice
- Team-building with answer set programming in the Gioia-Tauro seaport
- Logic Programming and Nonmonotonic Reasoning
- The design of the Seventh Answer Set Programming Competition
- The Intelligent Grounder of DLV
- The Sixth Answer Set Programming Competition
- Design and results of the Fifth Answer Set Programming Competition
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Optimum stable model search: algorithms and implementation
- Progress in clasp Series 3
- Blending lazy-grounding and CDNL search for answer-set solving
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- Anytime answer set optimization via unsatisfiable core shrinking
- ASPeRiX, a first-order forward chaining approach for answer set computing
Cited In (6)
- Incremental Answer Set Programming with Overgrounding
- Partial Compilation of ASP Programs
- Precomputing Datalog Evaluation Plans in Large-Scale Scenarios
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
Uses Software
This page was built for publication: Efficiently Coupling the 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)
