Technical note. Efficiently coupling the I-DLV grounder with ASP solvers
From MaRDI portal
Publication:4957193
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
Cites work
- 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
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- 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 design of the Seventh Answer Set Programming Competition
- The DLV system for knowledge representation and reasoning
- The intelligent grounder of DLV
- The Sixth Answer Set Programming Competition
- 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
(15)- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- The ASP system DLV2
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
- The intelligent grounder of DLV
- Multi-engine ASP solving with policy adaptation
- scientific article; zbMATH DE number 1884396 (Why is no real title available?)
- Partial compilation of ASP programs
- Incremental answer set programming with overgrounding
- Precomputing Datalog evaluation plans in large-scale scenarios
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Applying machine learning techniques to ASP solving
- Handling irresolvable conflicts in the semantic web: an RDF-based conflict-tolerant version of the deontic traditional scheme
- An efficient solver for ASP(Q)
- On the configuration of more and less expressive logic programs
- Aggregate semantics for propositional answer set programs
Describes a project that uses
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)
