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

DOI10.1017/S1471068418000546MaRDI QIDQ4957193zbMATH OpenOpenAlexFDO

Authors Francesco Calimeri, Carmine Dodaro, Davide Fuscà, Simona Perri, Jessica Zangari

Publication date 3 September 2021

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

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

zbMATH Keywords

constraintsnonmonotonic reasoningknowledge representation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

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

Recommendations

• The ASP system DLV2
• The intelligent grounder of DLV
• Applying machine learning techniques to ASP solving
• scientific article; zbMATH DE number 1890626
• Multi-level Algorithm Selection for ASP

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Advances in WASP
• Anytime answer set optimization via unsatisfiable core shrinking
• Blending lazy-grounding and CDNL search for answer-set solving
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Conflict-driven answer set solving: from theory to practice
• Design and results of the Fifth Answer Set Programming Competition
• Extending and implementing the stable model semantics
• GASP: Answer set programming with lazy grounding
• Logic Programming and Nonmonotonic Reasoning
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• Optimum stable model search: algorithms and implementation
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
• Progress in clasp series 3
• Random forests
• SATzilla: portfolio-based algorithm selection for SAT
• Team-building with answer set programming in the Gioia-Tauro seaport
• The ASP system DLV2
• The DLV system for knowledge representation and reasoning
• The Sixth Answer Set Programming Competition
• The design of the Seventh Answer Set Programming Competition
• The intelligent grounder of DLV
• Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing

Cited in

(11)

• The ASP system DLV2
• Multi-engine ASP solving with policy adaptation
• scientific article; zbMATH DE number 1884396 (Why is no real title available?)
• Applying machine learning techniques to ASP solving
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Incremental answer set programming with overgrounding
• Partial compilation of ASP programs
• A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
• Precomputing Datalog evaluation plans in large-scale scenarios
• The intelligent grounder of DLV
• Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring

Describes a project that uses

Uses Software

• GitHub
• DLV2
• OMiGA
• IDP3
• Auto-WEKA
• claspfolio 2
• Clingo
• WASP
• GASP
• clasp
• SATzilla
• DLV
• Lparse
• Gringo
• Cmodels

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)