Technical note. Efficiently coupling the I-DLV grounder with ASP solvers
DOI10.1017/S1471068418000546zbMATH Open1472.68179arXiv1810.00041OpenAlexW2893932668MaRDI QIDQ4957193FDOQ4957193
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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- 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 with IDP3
- Random forests
- Extending and implementing the stable model semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- The DLV system for knowledge representation and reasoning
- A self-adaptive multi-engine solver for quantified Boolean formulas
- SATzilla: portfolio-based algorithm selection for SAT
- 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
- {\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
- Title not available (Why is that?)
- 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
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)