Efficiently Coupling the I-DLV Grounder with ASP Solvers
From MaRDI portal
Publication:4957193
DOI10.1017/S1471068418000546zbMath1472.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)
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)
Related Items (5)
Partial Compilation of ASP Programs ⋮ Incremental Answer Set Programming with Overgrounding ⋮ Precomputing Datalog Evaluation Plans in Large-Scale Scenarios ⋮ Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring ⋮ A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design and results of the Fifth Answer Set Programming Competition
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- The design of the Seventh Answer Set Programming Competition
- Blending lazy-grounding and CDNL search for answer-set solving
- The ASP system DLV2
- The Intelligent Grounder of DLV
- Team-building with answer set programming in the Gioia-Tauro seaport
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Optimum stable model search: algorithms and implementation
- GASP: Answer Set Programming with Lazy Grounding
- Advances in WASP
- Progress in clasp Series 3
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Anytime answer set optimization via unsatisfiable core shrinking
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- ASPeRiX, a first-order forward chaining approach for answer set computing
- The DLV system for knowledge representation and reasoning
- The Sixth Answer Set Programming Competition
- Logic Programming and Nonmonotonic Reasoning
- Random forests
This page was built for publication: Efficiently Coupling the I-DLV Grounder with ASP Solvers